#include "game.h" #include #include #include #define MAX_RAND_TRIES_PER_WORD 10 #define EMPTY_CHAR 0 int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int gridSize, char words[][100], unsigned int wordCount) { // 1. Spielfeld initialisieren memset(salad, EMPTY_CHAR, MAX_SEARCH_FIELD_LEN * MAX_SEARCH_FIELD_LEN); int placedWordsCount = 0; // 2. Wörter im Spielfeld platzieren for (unsigned int i = 0; i < wordCount; i++) { int len = (int)strlen(words[i]); // Wörter überspringen, die leer oder zu lang für das Suchfeld (gridSize) sind if (len == 0 || (unsigned int)len > gridSize) continue; for (int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD; attempt++) { Direction dir = (rand() % 2 == 0) ? DIR_HORIZONTAL : DIR_VERTICAL; int dr = (dir == DIR_VERTICAL) ? 1 : 0; // Zeilensprung int dc = (dir == DIR_HORIZONTAL) ? 1 : 0; // Spaltensprung // Startkoordinaten innerhalb der gridSize wählen int row = rand() % (gridSize - (dir == DIR_VERTICAL ? len - 1 : 0)); int col = rand() % (gridSize - (dir == DIR_HORIZONTAL ? len - 1 : 0)); // Kollisionsprüfung int canPlace = 1; for (int k = 0; k < len; k++) { char current = salad[row + k * dr][col + k * dc]; if (current != EMPTY_CHAR && current != words[i][k]) { canPlace = 0; break; } } // Wort ins Spielfeld eintragen if (canPlace) { for (int k = 0; k < len; k++) { salad[row + k * dr][col + k * dc] = words[i][k]; } placedWordsCount++; break; } } } // 3. Verbleibende leere Felder innerhalb der gridSize auffüllen for (unsigned int r = 0; r < gridSize; r++) { for (unsigned int c = 0; c < gridSize; c++) { if (salad[r][c] == EMPTY_CHAR) { salad[r][c] = 'A' + (rand() % 26); } } } return placedWordsCount; }