generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
7
Commits
ace90fe687
..
main
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
c410d9287e | ||
|
|
4d09d52506 | ||
|
|
9a1f2d1d8a | ||
|
|
46a6f8c682 | ||
|
|
a763ea910e | ||
|
|
9b54d8913e | ||
|
|
19d0e9c170 |
No files matched your search
+22
-19
@@ -8,10 +8,6 @@
|
||||
#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 */
|
||||
|
||||
// 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)
|
||||
{
|
||||
@@ -23,24 +19,28 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
}
|
||||
}
|
||||
|
||||
int wordsPlaced = 0; // Track number of words successfully placed
|
||||
int wordsPlaced = 0; //Track number of words successfully placed
|
||||
|
||||
// Try to place each word
|
||||
//Try to place each word
|
||||
for(int w = 0; w < wordCount; w++){
|
||||
int wordLen = strlen(words[w]);
|
||||
int placed = 0;
|
||||
|
||||
// Try multiple times to find a valid position
|
||||
if(wordLen > searchFieldLen){
|
||||
//printf("Word %s is too long!\n", words[w]);
|
||||
break;
|
||||
}
|
||||
//Try multiple times to find a valid position
|
||||
for(int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD && !placed; attempt++){
|
||||
// Random orientation: 0 = horizontal, 1 = vertical
|
||||
//Random orientation: 0 = horizontal, 1 = vertical
|
||||
int orientation = rand() % 2;
|
||||
int row, col;
|
||||
|
||||
if(orientation == 0){ // Horizontal
|
||||
if(orientation == 0){ //Horizontal
|
||||
row = rand() % searchFieldLen;
|
||||
col = rand() % (searchFieldLen - wordLen + 1); // Ensure word fits
|
||||
col = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
|
||||
|
||||
// Check if position is free
|
||||
//Check if position is free
|
||||
int canPlace = 1;
|
||||
for(int i = 0; i < wordLen; i++){
|
||||
if(salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != words[w][i]){
|
||||
@@ -49,7 +49,7 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
}
|
||||
}
|
||||
|
||||
// Place word if position is valid
|
||||
//Place word
|
||||
if(canPlace){
|
||||
for(int i = 0; i < wordLen; i++){
|
||||
salad[row][col + i] = words[w][i];
|
||||
@@ -58,11 +58,11 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
wordsPlaced++;
|
||||
}
|
||||
}
|
||||
else{ // Vertical
|
||||
row = rand() % (searchFieldLen - wordLen + 1); // Ensure word fits
|
||||
else{ //Vertical
|
||||
row = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
|
||||
col = rand() % searchFieldLen;
|
||||
|
||||
// Check if position is free
|
||||
//Check if position is free
|
||||
int canPlace = 1;
|
||||
for(int i = 0; i < wordLen; i++){
|
||||
if(salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != words[w][i]){
|
||||
@@ -71,7 +71,7 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
}
|
||||
}
|
||||
|
||||
// Place word if position is valid
|
||||
//Place word if position is valid
|
||||
if(canPlace){
|
||||
for(int i = 0; i < wordLen; i++){
|
||||
salad[row + i][col] = words[w][i];
|
||||
@@ -83,7 +83,7 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
}
|
||||
}
|
||||
|
||||
// Fill remaining empty cells with random letters
|
||||
//Fill remaining empty cells with random letters
|
||||
for(int i = 0; i < searchFieldLen; i++){
|
||||
for(int j = 0; j < searchFieldLen; j++){
|
||||
if(salad[i][j] == EMPTY_CHAR){
|
||||
@@ -92,22 +92,25 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
||||
}
|
||||
}
|
||||
|
||||
return wordsPlaced; // Return number of words successfully placed
|
||||
return wordsPlaced;
|
||||
|
||||
|
||||
|
||||
}
|
||||
|
||||
// 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++){
|
||||
puts(salad[i][j]);
|
||||
printf("%c ", salad[i][j]);
|
||||
}
|
||||
puts("\n");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
//Fill up Word salad
|
||||
void fillWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]){
|
||||
|
||||
|
||||
+2
-2
@@ -24,7 +24,7 @@ int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
||||
char readLine[MAX_LINE_LEN];
|
||||
|
||||
// collects the words line by line and adds them to the list, if its not exceeding the max word count
|
||||
while (fgets(readLine, sizeof(readLine), file) != (NULL && wordcount < maxWordCount)) {
|
||||
while (fgets(readLine, sizeof(readLine), file) != NULL && (wordcount < maxWordCount)) {
|
||||
|
||||
char word[MAX_WORD_LEN];
|
||||
int wordIndex = 0;
|
||||
@@ -59,7 +59,7 @@ int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
||||
//Edge case: If the last word ends on a '\0', right after the last letter
|
||||
if (wordIndex > 0 && wordcount < maxWordCount) {
|
||||
word[wordIndex] = '\0';
|
||||
strcp(words[wordcount], word);
|
||||
strcpy(words[wordcount], word);
|
||||
wordcount++;
|
||||
}
|
||||
|
||||
|
||||
+8
-4
@@ -7,6 +7,7 @@
|
||||
#define MAX_NUMBER_OF_WORDS 100
|
||||
#define SALAD_SIZE 20
|
||||
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int exitCode = EXIT_SUCCESS;
|
||||
@@ -36,10 +37,13 @@ int main(int argc, char *argv[])
|
||||
// Create the word salad by placing words into grid
|
||||
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
|
||||
|
||||
// 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){
|
||||
printf("%d Words didn't fit!\n", wordCount-placedWords);
|
||||
return -1;
|
||||
}
|
||||
|
||||
showWordSalad(wordSalad, SALAD_SIZE);
|
||||
|
||||
|
||||
startGame(wordSalad, SALAD_SIZE, words, wordCount, 600);
|
||||
|
||||
|
||||
Reference in new issue
Block a user