Compare commits
2 Commits
bda3c2b104
...
ebb886ae9e
| Author | SHA1 | Date | |
|---|---|---|---|
| ebb886ae9e | |||
| 1ca4567185 |
@ -6,19 +6,20 @@
|
||||
#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 */
|
||||
void emptyArray();
|
||||
int placeWord();
|
||||
void fillEmptySpots();
|
||||
|
||||
//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)
|
||||
{
|
||||
srand(time(NULL));
|
||||
emptyArray(salad,MAX_SEARCH_FIELD_LEN * MAX_SEARCH_FIELD_LEN);
|
||||
placeWord(salad,words);
|
||||
fillEmptySpots(salad);
|
||||
fillEmptySpots(salad, MAX_SEARCH_FIELD_LEN * MAX_SEARCH_FIELD_LEN);
|
||||
}
|
||||
|
||||
// Prints the word salad to console
|
||||
@ -46,10 +47,35 @@ void emptyArray(char array[][], int arrayLength)
|
||||
|
||||
int placeWord(char intoArray[][], char insertedWord[][])
|
||||
{
|
||||
|
||||
int numberWord;
|
||||
int tries;
|
||||
while(tries <= MAX_RAND_TRIES_PER_WORD)
|
||||
{
|
||||
int xCord = rand() % MAX_SEARCH_FIELD_LEN;
|
||||
int yCord = rand() % MAX_SEARCH_FIELD_LEN;
|
||||
int isHorizontal = rand() % 2;
|
||||
|
||||
if(isHorizontal)
|
||||
{
|
||||
if(xCord + sizeof(insertedWord[numberWord][0]) <= MAX_SEARCH_FIELD_LEN)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void fillEmptySpots(char useArray[][])
|
||||
void fillEmptySpots(char array[][], int arrayLength)
|
||||
{
|
||||
|
||||
char* element = (char*) &array;
|
||||
for(int i = 0; i < arrayLength; i++ )
|
||||
{
|
||||
if(*element == EMPTY_CHAR)
|
||||
{
|
||||
*element == rand() % ('Z' - 'A' + 1) + 'A';
|
||||
}
|
||||
element++;
|
||||
}
|
||||
|
||||
}
|
||||
@ -2,28 +2,26 @@
|
||||
#include <ctype.h>
|
||||
#include <string.h>
|
||||
|
||||
// TODO:
|
||||
// eine Funktion implementieren, die ein einzelnes Wort aus einer Textdatei
|
||||
// (words.txt) einliest und als C-String zurückgibt.
|
||||
|
||||
// Read words from file and store in 'words' array
|
||||
int readWords(FILE *file, char words[][MAX_WORD_LEN],unsigned int maxWordCount)
|
||||
{
|
||||
|
||||
char puffer[MAX_WORD_LEN];
|
||||
file = fopen("words.txt", "r");
|
||||
if (file == NULL)
|
||||
{
|
||||
perror("File couldn't be opened");
|
||||
return -1;
|
||||
}
|
||||
|
||||
char fehlerhafterString[MAX_LINE_LEN];
|
||||
char *teiler = " ;,.\n";
|
||||
char teiler[] = " ;,.\n";
|
||||
char *aktuellesWort;
|
||||
int wortAnzahl = 0;
|
||||
|
||||
while (fgets(fehlerhafterString, sizeof(fehlerhafterString), file) != NULL && wortAnzahl < maxWordCount)
|
||||
while (fgets(puffer, MAX_WORD_LEN, file) != NULL)
|
||||
{
|
||||
|
||||
aktuellesWort = strtok(fehlerhafterString, teiler);
|
||||
aktuellesWort = strtok(puffer, teiler);
|
||||
|
||||
while (aktuellesWort != NULL && wortAnzahl < maxWordCount)
|
||||
{
|
||||
@ -33,6 +31,6 @@ int readWords(FILE *file, char words[][MAX_WORD_LEN],unsigned int maxWordCount)
|
||||
aktuellesWort = strtok(NULL, teiler); // Nächstes Token
|
||||
}
|
||||
}
|
||||
|
||||
fclose(file);
|
||||
return wortAnzahl; // Anzahl der eingelesenen Wörter
|
||||
}
|
||||
@ -38,8 +38,17 @@ int main(int argc, char *argv[])
|
||||
|
||||
// TODO:
|
||||
// Check if all words were successfully placed
|
||||
// Start the game if successful
|
||||
// error message if some words couldn't be placed
|
||||
if(placedWords == wordCount)
|
||||
{
|
||||
// Start the game if successful
|
||||
}
|
||||
else
|
||||
{
|
||||
// error message if some words couldn't be placed
|
||||
fprintf(stderr, "Could not place every word \n");
|
||||
exitCode = EXIT_FAILURE;
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
else
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user