kleinleinta105608/Informatik2-Praktikum-Wortsalat
2
0 Fork 1
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

test

Browse Source
This commit is contained in:
zidanmo99094 committed 2026-10-30 15:24:24 +01:00
1 parent 561fd213b6
commit c859d76447
1 file changed
+4 -10
Download Patch File Download Diff File Expand all files Collapse all files
Startcode/game.c
+4 -10
View File
@@ -9,41 +9,36 @@
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int wordCount, char words[][MAX_WORD_LEN], unsigned int gridSize) int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int wordCount, char words[][MAX_WORD_LEN], unsigned int gridSize)
{ {
// 1. Spielfeld vollständig mit EMPTY_CHAR zurücksetzen // 1. Spielfeld zurücksetzen
memset(salad, EMPTY_CHAR, MAX_SEARCH_FIELD_LEN * MAX_SEARCH_FIELD_LEN); memset(salad, EMPTY_CHAR, MAX_SEARCH_FIELD_LEN * MAX_SEARCH_FIELD_LEN);
int placedWordsCount = 0; int placedWordsCount = 0;
// 2. Wörter im Spielfeld platzieren // 2. Wörter platzieren
for (unsigned int i = 0; i < wordCount; i++) { for (unsigned int i = 0; i < wordCount; i++) {
// Wortlänge ermitteln
size_t len = strlen(words[i]); size_t len = strlen(words[i]);
// Unsichtbare Steuerzeichen / Leerzeichen am Ende abschneiden // Steuerzeichen am Ende entfernen
while (len > 0 && (words[i][len - 1] == '\n' || words[i][len - 1] == '\r' || words[i][len - 1] == ' ' || words[i][len - 1] == '\t')) { while (len > 0 && (words[i][len - 1] == '\n' || words[i][len - 1] == '\r' || words[i][len - 1] == ' ' || words[i][len - 1] == '\t')) {
words[i][--len] = '\0'; words[i][--len] = '\0';
} }
// Wörter ignorieren, die leer oder zu lang für das Spielfeld sind
if (len == 0 || len > gridSize) { if (len == 0 || len > gridSize) {
continue; continue;
} }
// Versuche, eine freie und kollisionsfreie Position zu finden
for (int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD; attempt++) { for (int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD; attempt++) {
Direction dir = (rand() % 2 == 0) ? DIR_HORIZONTAL : DIR_VERTICAL; Direction dir = (rand() % 2 == 0) ? DIR_HORIZONTAL : DIR_VERTICAL;
int dr = (dir == DIR_VERTICAL) ? 1 : 0; int dr = (dir == DIR_VERTICAL) ? 1 : 0;
int dc = (dir == DIR_HORIZONTAL) ? 1 : 0; int dc = (dir == DIR_HORIZONTAL) ? 1 : 0;
// Startkoordinaten so wählen, dass das Wort komplett im Spielfeld liegt
unsigned int maxRow = (dir == DIR_VERTICAL) ? (gridSize - (unsigned int)len + 1) : gridSize; unsigned int maxRow = (dir == DIR_VERTICAL) ? (gridSize - (unsigned int)len + 1) : gridSize;
unsigned int maxCol = (dir == DIR_HORIZONTAL) ? (gridSize - (unsigned int)len + 1) : gridSize; unsigned int maxCol = (dir == DIR_HORIZONTAL) ? (gridSize - (unsigned int)len + 1) : gridSize;
unsigned int row = (unsigned int)(rand() % maxRow); unsigned int row = (unsigned int)(rand() % maxRow);
unsigned int col = (unsigned int)(rand() % maxCol); unsigned int col = (unsigned int)(rand() % maxCol);
// Prüfen, ob alle benötigten Felder frei oder mit demselben Buchstaben belegt sind
int canPlace = 1; int canPlace = 1;
for (unsigned int k = 0; k < len; k++) { for (unsigned int k = 0; k < len; k++) {
char current = salad[row + k * dr][col + k * dc]; char current = salad[row + k * dr][col + k * dc];
@@ -55,7 +50,6 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
} }
} }
// Wort in Großbuchstaben eintragen, wenn der Platz gültig ist
if (canPlace) { if (canPlace) {
for (unsigned int k = 0; k < len; k++) { for (unsigned int k = 0; k < len; k++) {
salad[row + k * dr][col + k * dc] = (char)toupper((unsigned char)words[i][k]); salad[row + k * dr][col + k * dc] = (char)toupper((unsigned char)words[i][k]);
@@ -66,7 +60,7 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
} }
} }
// 3. Verbleibende leere Felder innerhalb der gridSize mit Zufallsbuchstaben ('A'-'Z') füllen // 3. Leere Felder mit Zufallsbuchstaben ('A'-'Z') füllen
for (unsigned int r = 0; r < gridSize; r++) { for (unsigned int r = 0; r < gridSize; r++) {
for (unsigned int c = 0; c < gridSize; c++) { for (unsigned int c = 0; c < gridSize; c++) {
if (salad[r][c] == EMPTY_CHAR) { if (salad[r][c] == EMPTY_CHAR) {