fertig 2.0

This commit is contained in:
hentschdu103698 committed 2026-11-03 16:27:16 +01:00
1 parent 6259f06391
commit 4e556279e5
9 files changed
+141 -94

No files matched your search

+84 -66
View File
@@ -2,76 +2,94 @@
#include <time.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define MAX_RAND_TRIES_PER_WORD 10
#define EMPTY_CHAR 0
//TODO: Spiellogik implementieren:
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
* restliche Felder mit zufälligen Buchstaben füllen */
static int canPlace(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int len,
unsigned int row, unsigned int col,
unsigned int dRow, unsigned int dCol)
{
for (unsigned int i = 0; i < len; i++)
{
char cell = salad[row + i * dRow][col + i * dCol];
if (cell != EMPTY_CHAR && cell != (char)toupper((unsigned char)word[i]))
{
return 0;
}
}
return 1;
}
static void placeWord(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int len,
unsigned int row, unsigned int col,
unsigned int dRow, unsigned int dCol)
{
for (unsigned int i = 0; i < len; i++)
{
salad[row + i * dRow][col + i * dCol] = (char)toupper((unsigned char)word[i]);
}
}
// 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)
{
// Initialize the salad with empty characters
for (unsigned int i = 0; i < searchFieldLen; i++) {
for (unsigned int j = 0; j < searchFieldLen; j++) {
salad[i][j] = EMPTY_CHAR;
}
}
// Seed the random number generator
srand((unsigned int)time(NULL));
// Place each word in the salad
for (unsigned int w = 0; w < wordCount; w++) {
const char *word = words[w];
unsigned int wordLen = strlen(word);
int placed = 0;
for (int tries = 0; tries < MAX_RAND_TRIES_PER_WORD && !placed; tries++) {
// Randomly choose orientation: 0 for horizontal, 1 for vertical
int orientation = rand() % 2;
unsigned int row, col;
if (orientation == 0) { // Horizontal
row = rand() % searchFieldLen;
col = rand() % (searchFieldLen - wordLen + 1);
// Check if the space is free
int canPlace = 1;
for (unsigned int k = 0; k < wordLen; k++) {
if (salad[row][col + k] != EMPTY_CHAR) {
canPlace = 0;
break;
}
}
if (canPlace) {
for (unsigned int k = 0; k < wordLen; k++) {
salad[row][col + k] = word[k];
}
placed = 1;
}
} else { // Vertical
row = rand() % (searchFieldLen - wordLen + 1);
col = rand() % searchFieldLen;
// Check if the space is free
int canPlace = 1;
for (unsigned int k = 0; k < wordLen; k++) {
if (salad[row + k][col] != EMPTY_CHAR) {
canPlace = 0;
break;
}
}
if (canPlace) {
for (unsigned int k = 0; k < wordLen; k++) {
salad[row + k][col] = word[k];
}
placed = 1;
}
}
}
if (!placed) {
return -1; // Failed to place the word after max tries
}
}
unsigned int placed = 0;
srand((unsigned int)time(NULL));
for (unsigned int r = 0; r < searchFieldLen; r++)
{
for (unsigned int c = 0; c < searchFieldLen; c++)
{
salad[r][c] = EMPTY_CHAR;
}
}
for (unsigned int w = 0; w < wordCount; w++)
{
unsigned int len = (unsigned int)strlen(words[w]);
if (len == 0 || len > searchFieldLen)
{
continue;
}
for (unsigned int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD; attempt++)
{
int horizontal = rand() % 2;
unsigned int dRow = horizontal ? 0 : 1;
unsigned int dCol = horizontal ? 1 : 0;
unsigned int maxRow = searchFieldLen - (len - 1) * dRow;
unsigned int maxCol = searchFieldLen - (len - 1) * dCol;
unsigned int row = (unsigned int)rand() % maxRow;
unsigned int col = (unsigned int)rand() % maxCol;
if (canPlace(salad, words[w], len, row, col, dRow, dCol))
{
placeWord(salad, words[w], len, row, col, dRow, dCol);
placed++;
break;
}
}
}
for (unsigned int r = 0; r < searchFieldLen; r++)
{
for (unsigned int c = 0; c < searchFieldLen; c++)
{
if (salad[r][c] == EMPTY_CHAR)
{
salad[r][c] = (char)('A' + rand() % 26);
}
}
}
return (int)placed;
}