Compare commits

..

3 Commits

Author SHA1 Message Date
d914e8aebf Fertiges Programm 2025-11-03 13:32:33 +01:00
81cd68b949 Testfile 2025-10-21 11:11:19 +02:00
c8dd40149a Test hinzugefügt 2025-10-21 08:05:55 +00:00
19 changed files with 164 additions and 13 deletions

Binary file not shown.

Binary file not shown.

Binary file not shown.

Binary file not shown.

View File

@ -0,0 +1,11 @@
{
"folders": [
{
"path": "../../../Documents/Wichtiges/Arbeit/Kalenderjahr 2025/Trainingscenter/4.Woche/VSS Code"
},
{
"path": "../../../VSS"
}
],
"settings": {}
}

View File

@ -13,11 +13,109 @@
// Creates the word salad by placing words randomly and filling empty spaces
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
{
srand(time(NULL));
// wipe field
int placedWords = 0;
for (int i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen ; j++)
salad[i][j] = EMPTY_CHAR;
}
// place Words
for (int wordNumber = 0; wordNumber < wordCount; wordNumber++)
{
int wordlength = strlen(words[wordNumber]);
int placed = 0;
for (int try = 0; (try < MAX_RAND_TRIES_PER_WORD) && !placed; try++)
{
int horizontal = rand() % 2; // 0 vertikal --> 1 horizontal
int x = rand() % searchFieldLen;
int y = rand() % searchFieldLen;
if (horizontal)
{
if (x + wordlength > searchFieldLen) // word does not fit
{
continue;
}
int fits = 1;
for (int i = 0; i < wordlength; i++) // position already occupied by other word
{
if (salad[y][x + i] != EMPTY_CHAR)
{
fits = 0;
break;
}
}
if (fits)
{
for (int i = 0; i < wordlength; i++)
{
salad[y][x + i] = words[wordNumber][i];
}
placed = 1;
placedWords++;
}
}
else
{
if ((y + wordlength) > searchFieldLen)
{
continue;
}
int fits = 1;
for (int i = 0; i < wordlength; i++) // position already occupied by other word
{
if (salad[y + i][x] != EMPTY_CHAR)
{
fits = 0;
break;
}
}
if (fits)
{
for (int i = 0; i < wordlength; i++)
{
salad[y + i][x] = words[wordNumber][i];
}
placed = 1;
placedWords++;
}
}
}
}
// fill rest with random characters
for (int i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen; j++)
{
if (salad[i][j] == EMPTY_CHAR)
{
salad[i][j] = rand() % ('Z' - 'A' + 1) + 'A'; // 90 ist Z in ASCII und A ist 65
}
}
}
return placedWords;
}
// Prints the word salad to console
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
{
for (int i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen; j++)
{
printf("%c", salad[i][j]);
}
}
}

BIN
Start_Windows/game.o Normal file

Binary file not shown.

Binary file not shown.

View File

@ -8,5 +8,35 @@
// Read words from file and store in 'words' array
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
{
//kein fopen und fclose nötig, weil dies schon in der main passiert und mit *file übergeben wird//
if (file == NULL)
{
perror("Error invalid pointer to file");
return -1;
}
char line[1024];
unsigned int count = 0;
while (fgets(line, sizeof(line), file) && (count < maxWordCount))
{
line[strcspn(line, "\n")] = '\0';
char *token = strtok(line, " ;,");
while (token && (count < maxWordCount))
{
for (int i = 0; token[i] != '\0'; i++)
{
token[i] = toupper(token[i]);
}
strcpy(words[count], token);
count++;
token = strtok(NULL, " ;,");
}
}
return count;
}

BIN
Start_Windows/input.o Normal file

Binary file not shown.

View File

@ -40,7 +40,14 @@ int main(int argc, char *argv[])
// Check if all words were successfully placed
// Start the game if successful
// error message if some words couldn't be placed
if (wordCount != placedWords)
{
fprintf(stderr, "Error: %u out of %u were placed\n", placedWords, wordCount);
}
else
{
startGame(wordSalad, SALAD_SIZE, words, placedWords, 1024);
}
}
else
{

BIN
Start_Windows/main.o Normal file

Binary file not shown.

View File

@ -6,6 +6,12 @@ BINARIES = ./windows
raylibfolder = ./raylib
unityfolder = ./unity
# --------------------------
# my version
# --------------------------
wordsalad_myversion: main.o graphicalGame.o
$(CC) main.o graphicalGame.o -o wordsalad_myversion $(BINARIES)/libwordsalad.a $(BINARIES)/libraylib.a $(LDFLAGS)
# --------------------------
# initiales Spiel bauen
# --------------------------

BIN
Start_Windows/runTests.exe Normal file

Binary file not shown.

View File

@ -1,5 +1,3 @@
Yeti,Nessie Werwolf; Vampir
Monster
Hydra;Frankenstein
Dracula;KingKong;Gremlin;Kobold,Hexe;Poltergeist
Gespenst, Oger
Multiplikation, Division, Addition, Subtraktion, Term
Bruch
Nenner, Zaehler, Daten, Saeulendiagramm

Binary file not shown.

Binary file not shown.

1
Test Normal file
View File

@ -0,0 +1 @@
Test