Compare commits
2 Commits
7e8bbea8a8
...
12464e4152
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
12464e4152 | ||
|
|
8269a05749 |
@ -6,18 +6,116 @@
|
||||
#define MAX_RAND_TRIES_PER_WORD 10
|
||||
#define EMPTY_CHAR 0
|
||||
|
||||
//TODO: Spiellogik implementieren:
|
||||
// TODO: Spiellogik implementieren:
|
||||
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
||||
* restliche Felder mit zufälligen Buchstaben füllen */
|
||||
|
||||
// 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)
|
||||
{
|
||||
Printf("Hello World+1");
|
||||
// wipe field
|
||||
int placedWords = 0;
|
||||
for (int i = 0; searchFieldLen < i; i++)
|
||||
{
|
||||
for (int j = 0; searchFieldLen < j; i++)
|
||||
salad[i][j] = EMPTY_CHAR;
|
||||
}
|
||||
// place Words
|
||||
for (int wordNumber = 0; wordNumber < wordCount; wordNumber++)
|
||||
{
|
||||
srand(time(NULL));
|
||||
int wordlength = strlen(words[wordNumber]);
|
||||
|
||||
int placed = 0;
|
||||
|
||||
for (int try = 0; (try < MAX_RAND_TRIES_PER_WORD) && !placed; try++)
|
||||
{
|
||||
int horizontal = rand() % 2;
|
||||
|
||||
int x = rand() % searchFieldLen;
|
||||
int y = rand() % searchFieldLen;
|
||||
|
||||
if (horizontal = 1)
|
||||
{
|
||||
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 + 1] != EMPTY_CHAR)
|
||||
{
|
||||
fits = 0;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (fits = 1)
|
||||
{
|
||||
for (int i = 0; i < wordlength; i++)
|
||||
{
|
||||
salad[y][x + 1] = 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 + 1][x] != EMPTY_CHAR)
|
||||
;
|
||||
{
|
||||
fits = 0;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (fits = 1)
|
||||
{
|
||||
for (int i = 0; i < wordlength; i++)
|
||||
{
|
||||
salad[y + 1][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() % ((90 - 65) + 1)) + 65; // 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]);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Binary file not shown.
Loading…
x
Reference in New Issue
Block a user