Compare commits

..

18 Commits

Author SHA1 Message Date
D2A62006
c410d9287e Remove TODO comments for game logic implementation in game.c 2025-11-06 13:47:48 +01:00
D2A62006
4d09d52506 final changes 2025-11-06 12:35:52 +01:00
D2A62006
9a1f2d1d8a Merge branch 'main' of https://git.efi.th-nuernberg.de/gitea/bruennerda98937/info2Wortsalat 2025-11-06 12:33:15 +01:00
D2A62006
46a6f8c682 Fixing warnings and errors, unit tests run 2025-11-06 12:33:13 +01:00
=
a763ea910e fixed warning with bad bracket placement 2025-11-05 20:44:15 +01:00
=
9b54d8913e Merge branch 'main' of https://git.efi.th-nuernberg.de/gitea/bruennerda98937/info2Wortsalat 2025-11-05 20:39:16 +01:00
=
19d0e9c170 fixed strcp to strpy in input.c 2025-11-05 20:39:14 +01:00
D2A62006
ace90fe687 Merge branch 'game_devel_1' 2025-11-05 20:37:52 +01:00
=
c93da286b9 Refactored the method input.c, so that it separates the words from one another and returns the wordcount 2025-11-05 20:34:52 +01:00
D2A62006
b49eecf1fa first running version 2025-11-05 19:32:37 +01:00
=
3e9dddae10 added progress from init.c to todo.md file 2025-11-05 11:12:54 +01:00
a1f73a0e33 added functionality to input.c 2025-11-05 11:05:51 +01:00
D2A62006
8d8cb57e79 add function header 2025-10-30 17:15:31 +01:00
D2A62006
93c4f16ebc make change order 2025-10-30 16:47:46 +01:00
510fec5852 added todo.md, which holds all pre-given instructions 2025-10-30 16:36:08 +01:00
D2A62006
343cc291ec refactor .gitignore to simplify entries and improve clarity 2025-10-30 16:25:29 +01:00
e815ad3822 add .vscode to gitignore 2025-10-30 16:13:32 +01:00
D2A62006
e7cdff98cb add additional files to .gitignore 2025-10-30 16:09:25 +01:00
15 changed files with 223 additions and 585 deletions

7
.gitignore vendored
View File

@ -1 +1,6 @@
Start_Linux/wordsalad_initial wordsalad_initial
runTests
.vscode
*.o
*.exe
wordsalad

View File

@ -2,159 +2,117 @@
#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)
{
// 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));
srand(time(NULL)); //Fill salad with empty_char
for(int i = 0; i < searchFieldLen; i++){
// Initialize the grid with empty characters for(int j = 0; j < searchFieldLen; j++){
for (unsigned int i = 0; i < searchFieldLen; i++) salad[i][j] = EMPTY_CHAR;
{ }
for (unsigned int j = 0; j < searchFieldLen; j++) }
{
salad[i][j] = EMPTY_CHAR; int wordsPlaced = 0; //Track number of words successfully placed
}
} //Try to place each word
for(int w = 0; w < wordCount; w++){
unsigned int placedWords = 0; int wordLen = strlen(words[w]);
int placed = 0;
// Try to place each word
for (unsigned int w = 0; w < wordCount; w++) if(wordLen > searchFieldLen){
{ //printf("Word %s is too long!\n", words[w]);
unsigned int wordLen = strlen(words[w]); break;
int placed = 0; }
//Try multiple times to find a valid position
// Skip empty words or words that are too long for(int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD && !placed; attempt++){
if (wordLen == 0 || wordLen > searchFieldLen) //Random orientation: 0 = horizontal, 1 = vertical
continue; int orientation = rand() % 2;
int row, col;
// Try to place the word MAX_RAND_TRIES_PER_WORD times
for (int tries = 0; tries < MAX_RAND_TRIES_PER_WORD && !placed; tries++) if(orientation == 0){ //Horizontal
{ row = rand() % searchFieldLen;
// Random direction: 0 = horizontal, 1 = vertical col = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
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 (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; }
placedWords++; placed = 1;
wordsPlaced++;
} }
} }
} else{ //Vertical
row = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
// Fill remaining empty spaces with random letters col = rand() % searchFieldLen;
for (unsigned int i = 0; i < searchFieldLen; i++)
{ //Check if position is free
for (unsigned int j = 0; j < searchFieldLen; j++) int canPlace = 1;
{ for(int i = 0; i < wordLen; i++){
if (salad[i][j] == EMPTY_CHAR) if(salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != words[w][i]){
{ canPlace = 0;
salad[i][j] = 'A' + (rand() % 26); break;
}
} }
}
} //Place word if position is valid
if(canPlace){
return placedWords; for(int i = 0; i < wordLen; i++){
salad[row + i][col] = words[w][i];
}
placed = 1;
wordsPlaced++;
}
}
}
}
//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){
salad[i][j] = 'A' + (rand() % 26);
}
}
}
return wordsPlaced;
} }
// 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],
unsigned int searchFieldLen) void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
{ {
printf("\nWord Salad:\n"); for(int i = 0; i < searchFieldLen; i++){
printf(" "); for(int j = 0; j < searchFieldLen; j++){
printf("%c ", salad[i][j]);
// Print column numbers }
for (unsigned int i = 0; i < searchFieldLen; i++) puts("\n");
{ }
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.

View File

@ -1,3 +1,12 @@
/*
----- input.c--------------------------------------------------------
Description: ReadWords: Takes a file and separates all the words from one another, returns the wordcount and an array with all words
Project: Praktikum Informatik 2
Author: kobma99134@th-nuernberg.de
Date: 05-11-2025
-------------------------------------------------------------------------
*/
#include "input.h" #include "input.h"
#include <string.h> #include <string.h>
#include <ctype.h> #include <ctype.h>
@ -5,35 +14,56 @@
// 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; // checks, if the file acually exists
char line[MAX_LINE_LEN]; if (file == NULL) {
return 0;
// 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; //return value: wordcount, as in the number of words that are being read
int wordcount = 0;
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)) {
char word[MAX_WORD_LEN];
int wordIndex = 0;
//reads every character in the line from start to finish, until the Enter key ('\0')
for (int i = 0; readLine[i] != '\0'; i++) {
// is the character a letter from the alphabet?
if(isalpha(readLine[i])) {
if (wordIndex < MAX_WORD_LEN) {
// clean code: We want only uppercase or only lowercase letters to avoid future problems...
word[wordIndex++] = toupper(readLine[i]);
}
}
else {
//if its not a letter, it has to be another character dividing two words e.g. ' ', ',', ';' etc.
if (wordIndex > 0) {
// we want a full word, not an empty string
word[wordIndex] = '\0';
// add the word to the wordlist
strcpy(words[wordcount], word);
wordcount++;
wordIndex = 0;
if (wordcount >= maxWordCount) {
return wordcount;
}
}
}
}
//Edge case: If the last word ends on a '\0', right after the last letter
if (wordIndex > 0 && wordcount < maxWordCount) {
word[wordIndex] = '\0';
strcpy(words[wordcount], word);
wordcount++;
}
}
// regular case: return the total number of words
return wordcount;
} }

Binary file not shown.

View File

@ -7,6 +7,7 @@
#define MAX_NUMBER_OF_WORDS 100 #define MAX_NUMBER_OF_WORDS 100
#define SALAD_SIZE 20 #define SALAD_SIZE 20
int main(int argc, char *argv[]) int main(int argc, char *argv[])
{ {
int exitCode = EXIT_SUCCESS; int exitCode = EXIT_SUCCESS;
@ -32,31 +33,20 @@ int main(int argc, char *argv[])
// Read words from file and store in 'words' array // Read words from file and store in 'words' array
wordCount = readWords(file, words, MAX_NUMBER_OF_WORDS); wordCount = readWords(file, words, MAX_NUMBER_OF_WORDS);
fclose(file); fclose(file);
// 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);
// Check if all words were successfully placed if(placedWords < wordCount){
if (placedWords == wordCount) printf("%d Words didn't fit!\n", wordCount-placedWords);
{ return -1;
// 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);
} }
showWordSalad(wordSalad, SALAD_SIZE);
startGame(wordSalad, SALAD_SIZE, words, wordCount, 600);
} }
else else
{ {

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.

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");
} }

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;
} }

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

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");
} }

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;
} }

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

13
todo.md Normal file
View File

@ -0,0 +1,13 @@
## 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
=> Die Methode sollte Fertig sein, ist aber noch nicht getestet.
#### 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