15 changed files with 196 additions and 575 deletions
+6 -1
View File
@@ -1 +1,6 @@
Start_Linux/wordsalad_initial wordsalad_initial
runTests
.vscode
*.o
*.exe
wordsalad
+74 -119
View File
@@ -2,159 +2,114 @@
#include <time.h> #include <time.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include <stdio.h> #include <stdint.h>
#define MAX_RAND_TRIES_PER_WORD 10 #define MAX_RAND_TRIES_PER_WORD 10
#define EMPTY_CHAR 0 #define EMPTY_CHAR 0
// Helper function to check if a word can be placed at a specific position
static int canPlaceWord(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int row, unsigned int col,
int horizontal, unsigned int searchFieldLen)
{
unsigned int wordLen = strlen(word);
if (horizontal) //TODO: Spiellogik implementieren:
{ /* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
// Check if word fits horizontally * restliche Felder mit zufälligen Buchstaben füllen */
if (col + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != word[i])
return 0;
}
}
else
{
// Check if word fits vertically
if (row + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != word[i])
return 0;
}
}
return 1;
}
// Helper function to place a word at a specific position
static void placeWord(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int row, unsigned int col,
int horizontal)
{
unsigned int wordLen = strlen(word);
if (horizontal)
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row][col + i] = word[i];
}
}
else
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row + i][col] = word[i];
}
}
}
// Creates the word salad by placing words randomly and filling empty spaces // Creates the word salad by placing words randomly and filling empty spaces
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
unsigned int searchFieldLen,
const char words[][MAX_WORD_LEN],
unsigned int wordCount)
{ {
// Initialize random seed
srand(time(NULL)); srand(time(NULL));
//Fill salad with empty_char
// Initialize the grid with empty characters for(int i = 0; i < searchFieldLen; i++){
for (unsigned int i = 0; i < searchFieldLen; i++) for(int j = 0; j < searchFieldLen; j++){
{
for (unsigned int j = 0; j < searchFieldLen; j++)
{
salad[i][j] = EMPTY_CHAR; salad[i][j] = EMPTY_CHAR;
} }
} }
unsigned int placedWords = 0; int wordsPlaced = 0; // Track number of words successfully placed
// Try to place each word // Try to place each word
for (unsigned int w = 0; w < wordCount; w++) for(int w = 0; w < wordCount; w++){
{ int wordLen = strlen(words[w]);
unsigned int wordLen = strlen(words[w]);
int placed = 0; int placed = 0;
// Skip empty words or words that are too long // Try multiple times to find a valid position
if (wordLen == 0 || wordLen > searchFieldLen) for(int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD && !placed; attempt++){
continue; // Random orientation: 0 = horizontal, 1 = vertical
int orientation = rand() % 2;
int row, col;
// Try to place the word MAX_RAND_TRIES_PER_WORD times if(orientation == 0){ // Horizontal
for (int tries = 0; tries < MAX_RAND_TRIES_PER_WORD && !placed; tries++) row = rand() % searchFieldLen;
{ col = rand() % (searchFieldLen - wordLen + 1); // Ensure word fits
// Random direction: 0 = horizontal, 1 = vertical
int horizontal = rand() % 2;
// Random position // Check if position is free
unsigned int row = rand() % searchFieldLen; int canPlace = 1;
unsigned int col = rand() % searchFieldLen; for(int i = 0; i < wordLen; i++){
if(salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != words[w][i]){
canPlace = 0;
break;
}
}
// Check if word can be placed // Place word if position is valid
if (canPlaceWord(salad, words[w], row, col, horizontal, searchFieldLen)) if(canPlace){
{ for(int i = 0; i < wordLen; i++){
placeWord(salad, words[w], row, col, horizontal); salad[row][col + i] = words[w][i];
}
placed = 1; placed = 1;
placedWords++; wordsPlaced++;
}
}
else{ // Vertical
row = rand() % (searchFieldLen - wordLen + 1); // Ensure word fits
col = rand() % searchFieldLen;
// 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]){
canPlace = 0;
break;
}
}
// Place word if position is valid
if(canPlace){
for(int i = 0; i < wordLen; i++){
salad[row + i][col] = words[w][i];
}
placed = 1;
wordsPlaced++;
}
} }
} }
} }
// Fill remaining empty spaces with random letters // Fill remaining empty cells with random letters
for (unsigned int i = 0; i < searchFieldLen; i++) for(int i = 0; i < searchFieldLen; i++){
{ for(int j = 0; j < searchFieldLen; j++){
for (unsigned int j = 0; j < searchFieldLen; j++) if(salad[i][j] == EMPTY_CHAR){
{
if (salad[i][j] == EMPTY_CHAR)
{
salad[i][j] = 'A' + (rand() % 26); salad[i][j] = 'A' + (rand() % 26);
} }
} }
} }
return placedWords; return wordsPlaced; // Return number of words successfully placed
} }
// Prints the word salad to console // Prints the word salad to console
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
unsigned int searchFieldLen)
{ {
printf("\nWord Salad:\n"); for(int i = 0; i < searchFieldLen; i++){
printf(" "); for(int j = 0; j < searchFieldLen; j++){
puts(salad[i][j]);
// Print column numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
} }
printf("\n");
// Print rows with row numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
for (unsigned int j = 0; j < searchFieldLen; j++)
{
printf("%2c ", salad[i][j]);
} }
printf("\n");
}
printf("\n");
} }
//Fill up Word salad
void fillWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]){
}
Binary file not shown.
+41 -20
View File
@@ -2,36 +2,57 @@
#include <string.h> #include <string.h>
#include <ctype.h> #include <ctype.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 // Read words from file and store in 'words' array
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount) int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
{ {
unsigned int wordCount = 0; if(file == NULL) {
char line[MAX_LINE_LEN]; return 0;
}
int wordCount = 0;
char buffer[1024]; // Buffer for reading lines
// Read file line by line // Read file line by line
while (fgets(line, MAX_LINE_LEN, file) != NULL && wordCount < maxWordCount) while(fgets(buffer, sizeof(buffer), file) != NULL && wordCount < maxWordCount) {
{ // Process each character in the line
// Process each line to extract words separated by delimiters char currentWord[MAX_WORD_LEN];
char *token = strtok(line, " ,;\n\t\r"); int wordIndex = 0;
while (token != NULL && wordCount < maxWordCount) for(int i = 0; buffer[i] != '\0'; i++) {
{ char c = buffer[i];
// Convert word to uppercase and store it
unsigned int i = 0; // Check if character is a letter
while (token[i] != '\0' && i < MAX_WORD_LEN - 1) if(isalpha(c)) {
{ // Convert to uppercase and add to current word
words[wordCount][i] = toupper((unsigned char)token[i]); if(wordIndex < MAX_WORD_LEN - 1) {
i++; currentWord[wordIndex++] = toupper(c);
} }
words[wordCount][i] = '\0'; }
else {
// Only count non-empty words // Non-letter character = word delimiter
if (i > 0) if(wordIndex > 0) {
{ // We have a complete word
currentWord[wordIndex] = '\0';
strcpy(words[wordCount], currentWord);
wordCount++; wordCount++;
wordIndex = 0;
// Check if we've reached max word count
if(wordCount >= maxWordCount) {
return wordCount;
}
}
}
} }
token = strtok(NULL, " ,;\n\t\r"); // Handle last word in line if it doesn't end with delimiter
if(wordIndex > 0 && wordCount < maxWordCount) {
currentWord[wordIndex] = '\0';
strcpy(words[wordCount], currentWord);
wordCount++;
} }
} }
Binary file not shown.
+4 -18
View File
@@ -36,26 +36,12 @@ int main(int argc, char *argv[])
// Create the word salad by placing words into grid // Create the word salad by placing words into grid
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount); placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
// TODO:
// Check if all words were successfully placed // Check if all words were successfully placed
if (placedWords == wordCount) // Start the game if successful
{ // error message if some words couldn't be placed
// All words placed successfully - start the game
printf("Successfully placed all %u words!\n", placedWords);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the graphical game startGame(wordSalad, SALAD_SIZE, words, wordCount, 600);
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
else
{
// Some words couldn't be placed
fprintf(stderr, "Warning: Could only place %u out of %u words.\n",
placedWords, wordCount);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the game anyway with the words that were placed
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
} }
else else
+8 -6
View File
@@ -6,12 +6,6 @@ BINARIES = ./linux
raylibfolder = ./raylib raylibfolder = ./raylib
unityfolder = ./unity unityfolder = ./unity
# --------------------------
# initiales Spiel bauen
# --------------------------
wordsalad_initial:
$(CC) -o wordsalad_initial -L. $(BINARIES)/libwordsalad_complete.a $(BINARIES)/libraylib.a $(LDFLAGS)
# -------------------------- # --------------------------
# Normales Spiel bauen # Normales Spiel bauen
# -------------------------- # --------------------------
@@ -30,6 +24,13 @@ game.o: game.c
graphicalGame.o: graphicalGame.c graphicalGame.o: graphicalGame.c
$(CC) $(CFLAGS) -I$(raylibfolder) -c graphicalGame.c $(CC) $(CFLAGS) -I$(raylibfolder) -c graphicalGame.c
# --------------------------
# initiales Spiel bauen
# --------------------------
wordsalad_initial:
$(CC) -o wordsalad_initial -L. $(BINARIES)/libwordsalad_complete.a $(BINARIES)/libraylib.a $(LDFLAGS)
# -------------------------- # --------------------------
# Unit Tests # Unit Tests
# -------------------------- # --------------------------
@@ -38,6 +39,7 @@ TEST_BIN = runTests
test: input.o game.o unit_tests.c test: input.o game.o unit_tests.c
$(CC) -I$(unityfolder) -o $(TEST_BIN) input.o game.o unit_tests.c $(BINARIES)/libunity.a $(CC) -I$(unityfolder) -o $(TEST_BIN) input.o game.o unit_tests.c $(BINARIES)/libunity.a
# -------------------------- # --------------------------
# Clean # Clean
# -------------------------- # --------------------------
Binary file not shown.
+5 -142
View File
@@ -2,159 +2,22 @@
#include <time.h> #include <time.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include <stdio.h>
#define MAX_RAND_TRIES_PER_WORD 10 #define MAX_RAND_TRIES_PER_WORD 10
#define EMPTY_CHAR 0 #define EMPTY_CHAR 0
// Helper function to check if a word can be placed at a specific position //TODO: Spiellogik implementieren:
static int canPlaceWord(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], /* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
const char *word, unsigned int row, unsigned int col, * restliche Felder mit zufälligen Buchstaben füllen */
int horizontal, unsigned int searchFieldLen)
{
unsigned int wordLen = strlen(word);
if (horizontal)
{
// Check if word fits horizontally
if (col + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != word[i])
return 0;
}
}
else
{
// Check if word fits vertically
if (row + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != word[i])
return 0;
}
}
return 1;
}
// Helper function to place a word at a specific position
static void placeWord(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int row, unsigned int col,
int horizontal)
{
unsigned int wordLen = strlen(word);
if (horizontal)
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row][col + i] = word[i];
}
}
else
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row + i][col] = word[i];
}
}
}
// Creates the word salad by placing words randomly and filling empty spaces // Creates the word salad by placing words randomly and filling empty spaces
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
unsigned int searchFieldLen,
const char words[][MAX_WORD_LEN],
unsigned int wordCount)
{ {
// Initialize random seed
srand(time(NULL));
// Initialize the grid with empty characters
for (unsigned int i = 0; i < searchFieldLen; i++)
{
for (unsigned int j = 0; j < searchFieldLen; j++)
{
salad[i][j] = EMPTY_CHAR;
}
}
unsigned int placedWords = 0;
// Try to place each word
for (unsigned int w = 0; w < wordCount; w++)
{
unsigned int wordLen = strlen(words[w]);
int placed = 0;
// Skip empty words or words that are too long
if (wordLen == 0 || wordLen > searchFieldLen)
continue;
// Try to place the word MAX_RAND_TRIES_PER_WORD times
for (int tries = 0; tries < MAX_RAND_TRIES_PER_WORD && !placed; tries++)
{
// Random direction: 0 = horizontal, 1 = vertical
int horizontal = rand() % 2;
// Random position
unsigned int row = rand() % searchFieldLen;
unsigned int col = rand() % searchFieldLen;
// Check if word can be placed
if (canPlaceWord(salad, words[w], row, col, horizontal, searchFieldLen))
{
placeWord(salad, words[w], row, col, horizontal);
placed = 1;
placedWords++;
}
}
}
// Fill remaining empty spaces with random letters
for (unsigned int i = 0; i < searchFieldLen; i++)
{
for (unsigned int j = 0; j < searchFieldLen; j++)
{
if (salad[i][j] == EMPTY_CHAR)
{
salad[i][j] = 'A' + (rand() % 26);
}
}
}
return placedWords;
} }
// Prints the word salad to console // Prints the word salad to console
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
unsigned int searchFieldLen)
{ {
printf("\nWord Salad:\n");
printf(" ");
// Print column numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
}
printf("\n");
// Print rows with row numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
for (unsigned int j = 0; j < searchFieldLen; j++)
{
printf("%2c ", salad[i][j]);
}
printf("\n");
}
printf("\n");
} }
+3 -30
View File
@@ -2,38 +2,11 @@
#include <string.h> #include <string.h>
#include <ctype.h> #include <ctype.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 // Read words from file and store in 'words' array
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount) int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
{ {
unsigned int wordCount = 0;
char line[MAX_LINE_LEN];
// Read file line by line
while (fgets(line, MAX_LINE_LEN, file) != NULL && wordCount < maxWordCount)
{
// Process each line to extract words separated by delimiters
char *token = strtok(line, " ,;\n\t\r");
while (token != NULL && wordCount < maxWordCount)
{
// Convert word to uppercase and store it
unsigned int i = 0;
while (token[i] != '\0' && i < MAX_WORD_LEN - 1)
{
words[wordCount][i] = toupper((unsigned char)token[i]);
i++;
}
words[wordCount][i] = '\0';
// Only count non-empty words
if (i > 0)
{
wordCount++;
}
token = strtok(NULL, " ,;\n\t\r");
}
}
return wordCount;
} }
+3 -19
View File
@@ -36,26 +36,10 @@ int main(int argc, char *argv[])
// Create the word salad by placing words into grid // Create the word salad by placing words into grid
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount); placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
// TODO:
// Check if all words were successfully placed // Check if all words were successfully placed
if (placedWords == wordCount) // Start the game if successful
{ // error message if some words couldn't be placed
// All words placed successfully - start the game
printf("Successfully placed all %u words!\n", placedWords);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the graphical game
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
else
{
// Some words couldn't be placed
fprintf(stderr, "Warning: Could only place %u out of %u words.\n",
placedWords, wordCount);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the game anyway with the words that were placed
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
} }
else else
+5 -142
View File
@@ -2,159 +2,22 @@
#include <time.h> #include <time.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include <stdio.h>
#define MAX_RAND_TRIES_PER_WORD 10 #define MAX_RAND_TRIES_PER_WORD 10
#define EMPTY_CHAR 0 #define EMPTY_CHAR 0
// Helper function to check if a word can be placed at a specific position //TODO: Spiellogik implementieren:
static int canPlaceWord(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], /* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
const char *word, unsigned int row, unsigned int col, * restliche Felder mit zufälligen Buchstaben füllen */
int horizontal, unsigned int searchFieldLen)
{
unsigned int wordLen = strlen(word);
if (horizontal)
{
// Check if word fits horizontally
if (col + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != word[i])
return 0;
}
}
else
{
// Check if word fits vertically
if (row + wordLen > searchFieldLen)
return 0;
// Check if all positions are empty or match the word
for (unsigned int i = 0; i < wordLen; i++)
{
if (salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != word[i])
return 0;
}
}
return 1;
}
// Helper function to place a word at a specific position
static void placeWord(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
const char *word, unsigned int row, unsigned int col,
int horizontal)
{
unsigned int wordLen = strlen(word);
if (horizontal)
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row][col + i] = word[i];
}
}
else
{
for (unsigned int i = 0; i < wordLen; i++)
{
salad[row + i][col] = word[i];
}
}
}
// Creates the word salad by placing words randomly and filling empty spaces // Creates the word salad by placing words randomly and filling empty spaces
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
unsigned int searchFieldLen,
const char words[][MAX_WORD_LEN],
unsigned int wordCount)
{ {
// Initialize random seed
srand(time(NULL));
// Initialize the grid with empty characters
for (unsigned int i = 0; i < searchFieldLen; i++)
{
for (unsigned int j = 0; j < searchFieldLen; j++)
{
salad[i][j] = EMPTY_CHAR;
}
}
unsigned int placedWords = 0;
// Try to place each word
for (unsigned int w = 0; w < wordCount; w++)
{
unsigned int wordLen = strlen(words[w]);
int placed = 0;
// Skip empty words or words that are too long
if (wordLen == 0 || wordLen > searchFieldLen)
continue;
// Try to place the word MAX_RAND_TRIES_PER_WORD times
for (int tries = 0; tries < MAX_RAND_TRIES_PER_WORD && !placed; tries++)
{
// Random direction: 0 = horizontal, 1 = vertical
int horizontal = rand() % 2;
// Random position
unsigned int row = rand() % searchFieldLen;
unsigned int col = rand() % searchFieldLen;
// Check if word can be placed
if (canPlaceWord(salad, words[w], row, col, horizontal, searchFieldLen))
{
placeWord(salad, words[w], row, col, horizontal);
placed = 1;
placedWords++;
}
}
}
// Fill remaining empty spaces with random letters
for (unsigned int i = 0; i < searchFieldLen; i++)
{
for (unsigned int j = 0; j < searchFieldLen; j++)
{
if (salad[i][j] == EMPTY_CHAR)
{
salad[i][j] = 'A' + (rand() % 26);
}
}
}
return placedWords;
} }
// Prints the word salad to console // Prints the word salad to console
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
unsigned int searchFieldLen)
{ {
printf("\nWord Salad:\n");
printf(" ");
// Print column numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
}
printf("\n");
// Print rows with row numbers
for (unsigned int i = 0; i < searchFieldLen; i++)
{
printf("%2u ", i);
for (unsigned int j = 0; j < searchFieldLen; j++)
{
printf("%2c ", salad[i][j]);
}
printf("\n");
}
printf("\n");
} }
+3 -30
View File
@@ -2,38 +2,11 @@
#include <string.h> #include <string.h>
#include <ctype.h> #include <ctype.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 // Read words from file and store in 'words' array
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount) int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
{ {
unsigned int wordCount = 0;
char line[MAX_LINE_LEN];
// Read file line by line
while (fgets(line, MAX_LINE_LEN, file) != NULL && wordCount < maxWordCount)
{
// Process each line to extract words separated by delimiters
char *token = strtok(line, " ,;\n\t\r");
while (token != NULL && wordCount < maxWordCount)
{
// Convert word to uppercase and store it
unsigned int i = 0;
while (token[i] != '\0' && i < MAX_WORD_LEN - 1)
{
words[wordCount][i] = toupper((unsigned char)token[i]);
i++;
}
words[wordCount][i] = '\0';
// Only count non-empty words
if (i > 0)
{
wordCount++;
}
token = strtok(NULL, " ,;\n\t\r");
}
}
return wordCount;
} }
+3 -19
View File
@@ -36,26 +36,10 @@ int main(int argc, char *argv[])
// Create the word salad by placing words into grid // Create the word salad by placing words into grid
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount); placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
// TODO:
// Check if all words were successfully placed // Check if all words were successfully placed
if (placedWords == wordCount) // Start the game if successful
{ // error message if some words couldn't be placed
// All words placed successfully - start the game
printf("Successfully placed all %u words!\n", placedWords);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the graphical game
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
else
{
// Some words couldn't be placed
fprintf(stderr, "Warning: Could only place %u out of %u words.\n",
placedWords, wordCount);
showWordSalad(wordSalad, SALAD_SIZE);
// Start the game anyway with the words that were placed
startGraphicalGame(wordSalad, SALAD_SIZE, words, wordCount);
}
} }
else else
+12
View File
@@ -0,0 +1,12 @@
## Todo
#### game.c
_Vorgegebene Anweisung:_
Wörter aus der Wortliste zufällig horizontal oder vertikal plazieren, restliche Felder mit zufälligen Buchstaben füllen
#### input.c
_Vorgegebene Anweisung:_
eine Funktion implementierenm die ein einzelnes Wort aus einer Textdatei (words.txt) einliest und als C-String zurückgibt
#### main.c
_Vorgegebene Anweisung:_
Check if all words were successfully placed
start the game if successfull
error message if some words couldn't be placed