generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
9
Commits
c93da286b9
..
main
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
c410d9287e | ||
|
|
4d09d52506 | ||
|
|
9a1f2d1d8a | ||
|
|
46a6f8c682 | ||
|
|
a763ea910e | ||
|
|
9b54d8913e | ||
|
|
19d0e9c170 | ||
|
|
ace90fe687 | ||
|
|
b49eecf1fa |
No files matched your search
+95
-5
@@ -2,27 +2,117 @@
|
|||||||
#include <time.h>
|
#include <time.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.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
|
||||||
|
|
||||||
//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
|
// 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));
|
||||||
|
//Fill salad with empty_char
|
||||||
|
for(int i = 0; i < searchFieldLen; i++){
|
||||||
|
for(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++){
|
||||||
|
int wordLen = strlen(words[w]);
|
||||||
|
int placed = 0;
|
||||||
|
|
||||||
|
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
|
||||||
|
int orientation = rand() % 2;
|
||||||
|
int row, col;
|
||||||
|
|
||||||
|
if(orientation == 0){ //Horizontal
|
||||||
|
row = rand() % searchFieldLen;
|
||||||
|
col = rand() % (searchFieldLen - wordLen + 1); //Ensure word fits
|
||||||
|
|
||||||
|
//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]){
|
||||||
|
canPlace = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Place word
|
||||||
|
if(canPlace){
|
||||||
|
for(int i = 0; i < wordLen; i++){
|
||||||
|
salad[row][col + i] = words[w][i];
|
||||||
|
}
|
||||||
|
placed = 1;
|
||||||
|
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 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)
|
||||||
{
|
{
|
||||||
|
for(int i = 0; i < searchFieldLen; i++){
|
||||||
|
for(int j = 0; j < searchFieldLen; j++){
|
||||||
|
printf("%c ", salad[i][j]);
|
||||||
|
}
|
||||||
|
puts("\n");
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
//Fill up Word salad
|
//Fill up Word salad
|
||||||
void fillWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]){
|
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];
|
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
|
// 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];
|
char word[MAX_WORD_LEN];
|
||||||
int wordIndex = 0;
|
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
|
//Edge case: If the last word ends on a '\0', right after the last letter
|
||||||
if (wordIndex > 0 && wordcount < maxWordCount) {
|
if (wordIndex > 0 && wordcount < maxWordCount) {
|
||||||
word[wordIndex] = '\0';
|
word[wordIndex] = '\0';
|
||||||
strcp(words[wordcount], word);
|
strcpy(words[wordcount], word);
|
||||||
wordcount++;
|
wordcount++;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
+11
-5
@@ -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,14 +33,19 @@ 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);
|
||||||
|
|
||||||
// TODO:
|
if(placedWords < wordCount){
|
||||||
// Check if all words were successfully placed
|
printf("%d Words didn't fit!\n", wordCount-placedWords);
|
||||||
// Start the game if successful
|
return -1;
|
||||||
// error message if some words couldn't be placed
|
}
|
||||||
|
|
||||||
|
showWordSalad(wordSalad, SALAD_SIZE);
|
||||||
|
|
||||||
|
|
||||||
|
startGame(wordSalad, SALAD_SIZE, words, wordCount, 600);
|
||||||
|
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
|||||||
Reference in new issue
Block a user