generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
1 Commits
main
...
copilot_te
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
f233fbf7e1 |
7
.gitignore
vendored
7
.gitignore
vendored
@ -1,6 +1 @@
|
|||||||
wordsalad_initial
|
Start_Linux/wordsalad_initial
|
||||||
runTests
|
|
||||||
.vscode
|
|
||||||
*.o
|
|
||||||
*.exe
|
|
||||||
wordsalad
|
|
||||||
|
|||||||
@ -2,117 +2,159 @@
|
|||||||
#include <time.h>
|
#include <time.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <stdint.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
|
||||||
|
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], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
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));
|
// Initialize random seed
|
||||||
//Fill salad with empty_char
|
srand(time(NULL));
|
||||||
for(int i = 0; i < searchFieldLen; i++){
|
|
||||||
for(int j = 0; j < searchFieldLen; j++){
|
// Initialize the grid with empty characters
|
||||||
salad[i][j] = EMPTY_CHAR;
|
for (unsigned int i = 0; i < searchFieldLen; i++)
|
||||||
}
|
{
|
||||||
}
|
for (unsigned int j = 0; j < searchFieldLen; j++)
|
||||||
|
{
|
||||||
int wordsPlaced = 0; //Track number of words successfully placed
|
salad[i][j] = EMPTY_CHAR;
|
||||||
|
}
|
||||||
//Try to place each word
|
}
|
||||||
for(int w = 0; w < wordCount; w++){
|
|
||||||
int wordLen = strlen(words[w]);
|
unsigned int placedWords = 0;
|
||||||
int placed = 0;
|
|
||||||
|
// Try to place each word
|
||||||
if(wordLen > searchFieldLen){
|
for (unsigned int w = 0; w < wordCount; w++)
|
||||||
//printf("Word %s is too long!\n", words[w]);
|
{
|
||||||
break;
|
unsigned int wordLen = strlen(words[w]);
|
||||||
}
|
int placed = 0;
|
||||||
//Try multiple times to find a valid position
|
|
||||||
for(int attempt = 0; attempt < MAX_RAND_TRIES_PER_WORD && !placed; attempt++){
|
// Skip empty words or words that are too long
|
||||||
//Random orientation: 0 = horizontal, 1 = vertical
|
if (wordLen == 0 || wordLen > searchFieldLen)
|
||||||
int orientation = rand() % 2;
|
continue;
|
||||||
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;
|
||||||
|
|
||||||
//Check if position is free
|
// Random position
|
||||||
int canPlace = 1;
|
unsigned int row = rand() % searchFieldLen;
|
||||||
for(int i = 0; i < wordLen; i++){
|
unsigned int col = rand() % searchFieldLen;
|
||||||
if(salad[row][col + i] != EMPTY_CHAR && salad[row][col + i] != words[w][i]){
|
|
||||||
canPlace = 0;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//Place word
|
// Check if word can be placed
|
||||||
if(canPlace){
|
if (canPlaceWord(salad, words[w], row, col, horizontal, searchFieldLen))
|
||||||
for(int i = 0; i < wordLen; i++){
|
{
|
||||||
salad[row][col + i] = words[w][i];
|
placeWord(salad, words[w], row, col, horizontal);
|
||||||
}
|
placed = 1;
|
||||||
placed = 1;
|
placedWords++;
|
||||||
wordsPlaced++;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else{ //Vertical
|
}
|
||||||
row = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
|
|
||||||
col = rand() % searchFieldLen;
|
// Fill remaining empty spaces with random letters
|
||||||
|
for (unsigned int i = 0; i < searchFieldLen; i++)
|
||||||
//Check if position is free
|
{
|
||||||
int canPlace = 1;
|
for (unsigned int j = 0; j < searchFieldLen; j++)
|
||||||
for(int i = 0; i < wordLen; i++){
|
{
|
||||||
if(salad[row + i][col] != EMPTY_CHAR && salad[row + i][col] != words[w][i]){
|
if (salad[i][j] == EMPTY_CHAR)
|
||||||
canPlace = 0;
|
{
|
||||||
break;
|
salad[i][j] = 'A' + (rand() % 26);
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
}
|
||||||
//Place word if position is valid
|
}
|
||||||
if(canPlace){
|
|
||||||
for(int i = 0; i < wordLen; i++){
|
return placedWords;
|
||||||
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],
|
||||||
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
|
unsigned int searchFieldLen)
|
||||||
{
|
{
|
||||||
for(int i = 0; i < searchFieldLen; i++){
|
printf("\nWord Salad:\n");
|
||||||
for(int j = 0; j < searchFieldLen; j++){
|
printf(" ");
|
||||||
printf("%c ", salad[i][j]);
|
|
||||||
}
|
// Print column numbers
|
||||||
puts("\n");
|
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]){
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|||||||
BIN
Start_Linux/game.o
Normal file
BIN
Start_Linux/game.o
Normal file
Binary file not shown.
@ -1,12 +1,3 @@
|
|||||||
/*
|
|
||||||
----- 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>
|
||||||
@ -14,56 +5,35 @@
|
|||||||
// 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)
|
||||||
{
|
{
|
||||||
// checks, if the file acually exists
|
unsigned int wordCount = 0;
|
||||||
if (file == NULL) {
|
char line[MAX_LINE_LEN];
|
||||||
return 0;
|
|
||||||
}
|
// Read file line by line
|
||||||
|
while (fgets(line, MAX_LINE_LEN, file) != NULL && wordCount < maxWordCount)
|
||||||
//return value: wordcount, as in the number of words that are being read
|
{
|
||||||
int wordcount = 0;
|
// Process each line to extract words separated by delimiters
|
||||||
char readLine[MAX_LINE_LEN];
|
char *token = strtok(line, " ,;\n\t\r");
|
||||||
|
|
||||||
// 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];
|
while (token != NULL && wordCount < maxWordCount)
|
||||||
int wordIndex = 0;
|
{
|
||||||
|
// Convert word to uppercase and store it
|
||||||
//reads every character in the line from start to finish, until the Enter key ('\0')
|
unsigned int i = 0;
|
||||||
for (int i = 0; readLine[i] != '\0'; i++) {
|
while (token[i] != '\0' && i < MAX_WORD_LEN - 1)
|
||||||
|
{
|
||||||
|
words[wordCount][i] = toupper((unsigned char)token[i]);
|
||||||
|
i++;
|
||||||
|
}
|
||||||
|
words[wordCount][i] = '\0';
|
||||||
|
|
||||||
// is the character a letter from the alphabet?
|
// Only count non-empty words
|
||||||
if(isalpha(readLine[i])) {
|
if (i > 0)
|
||||||
if (wordIndex < MAX_WORD_LEN) {
|
{
|
||||||
// clean code: We want only uppercase or only lowercase letters to avoid future problems...
|
wordCount++;
|
||||||
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;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
token = strtok(NULL, " ,;\n\t\r");
|
||||||
}
|
}
|
||||||
|
|
||||||
//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;
|
return wordCount;
|
||||||
}
|
}
|
||||||
BIN
Start_Linux/input.o
Normal file
BIN
Start_Linux/input.o
Normal file
Binary file not shown.
@ -7,7 +7,6 @@
|
|||||||
#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;
|
||||||
@ -33,19 +32,30 @@ 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);
|
||||||
|
|
||||||
if(placedWords < wordCount){
|
// Check if all words were successfully placed
|
||||||
printf("%d Words didn't fit!\n", wordCount-placedWords);
|
if (placedWords == wordCount)
|
||||||
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
|
||||||
|
|||||||
@ -6,6 +6,12 @@ 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
|
||||||
# --------------------------
|
# --------------------------
|
||||||
@ -24,13 +30,6 @@ 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
|
||||||
# --------------------------
|
# --------------------------
|
||||||
@ -39,7 +38,6 @@ 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
|
||||||
# --------------------------
|
# --------------------------
|
||||||
|
|||||||
BIN
Start_Linux/runTests
Normal file
BIN
Start_Linux/runTests
Normal file
Binary file not shown.
151
Start_Mac/game.c
151
Start_Mac/game.c
@ -2,22 +2,159 @@
|
|||||||
#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
|
||||||
|
|
||||||
//TODO: Spiellogik implementieren:
|
// Helper function to check if a word can be placed at a specific position
|
||||||
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
static int canPlaceWord(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
* restliche Felder mit zufälligen Buchstaben füllen */
|
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], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
|
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], unsigned int searchFieldLen)
|
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
|
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");
|
||||||
}
|
}
|
||||||
|
|||||||
@ -2,11 +2,38 @@
|
|||||||
#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;
|
||||||
}
|
}
|
||||||
@ -36,10 +36,26 @@ 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
|
||||||
// Start the game if successful
|
if (placedWords == wordCount)
|
||||||
// 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
|
||||||
|
|||||||
@ -2,22 +2,159 @@
|
|||||||
#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
|
||||||
|
|
||||||
//TODO: Spiellogik implementieren:
|
// Helper function to check if a word can be placed at a specific position
|
||||||
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
static int canPlaceWord(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
* restliche Felder mit zufälligen Buchstaben füllen */
|
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], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
|
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], unsigned int searchFieldLen)
|
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
|
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");
|
||||||
}
|
}
|
||||||
|
|||||||
@ -2,11 +2,38 @@
|
|||||||
#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;
|
||||||
}
|
}
|
||||||
@ -36,10 +36,26 @@ 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
|
||||||
// Start the game if successful
|
if (placedWords == wordCount)
|
||||||
// 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
13
todo.md
@ -1,13 +0,0 @@
|
|||||||
## 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
|
|
||||||
Loading…
x
Reference in New Issue
Block a user