generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
4
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
ace90fe687 | ||
|
|
c93da286b9 | ||
|
|
b49eecf1fa | ||
|
|
3e9dddae10 |
No files matched your search
+89
-2
@@ -2,10 +2,12 @@
|
|||||||
#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:
|
//TODO: Spiellogik implementieren:
|
||||||
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
||||||
* restliche Felder mit zufälligen Buchstaben füllen */
|
* restliche Felder mit zufälligen Buchstaben füllen */
|
||||||
@@ -13,16 +15,101 @@
|
|||||||
// 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;
|
||||||
|
|
||||||
|
// 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 position is valid
|
||||||
|
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; // 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], 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++){
|
||||||
|
puts(salad[i][j]);
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
//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]){
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
+58
-13
@@ -1,24 +1,69 @@
|
|||||||
|
/*
|
||||||
|
----- 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>
|
||||||
|
|
||||||
// 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)
|
||||||
{
|
{
|
||||||
char word[MAX_WORD_LEN];
|
// checks, if the file acually exists
|
||||||
|
if (file == NULL) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
// we possibly don't need fopen, since file is already a parameter
|
//return value: wordcount, as in the number of words that are being read
|
||||||
// fopen(stream)
|
int wordcount = 0;
|
||||||
|
char readLine[MAX_LINE_LEN];
|
||||||
|
|
||||||
fgets(word, MAX_WORD_LEN,file);
|
// collects the words line by line and adds them to the list, if its not exceeding the max word count
|
||||||
// fgets(string, length, file *stream)
|
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;
|
||||||
|
|
||||||
strcpy(words[maxWordCount-1], word);
|
if (wordcount >= maxWordCount) {
|
||||||
maxWordCount++;
|
return wordcount;
|
||||||
// we possibly also won't need to close the
|
}
|
||||||
// fclose( *<stream>)
|
}
|
||||||
return 0;
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Edge case: If the last word ends on a '\0', right after the last letter
|
||||||
|
if (wordIndex > 0 && wordcount < maxWordCount) {
|
||||||
|
word[wordIndex] = '\0';
|
||||||
|
strcp(words[wordcount], word);
|
||||||
|
wordcount++;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
// regular case: return the total number of words
|
||||||
|
return wordcount;
|
||||||
}
|
}
|
||||||
@@ -41,6 +41,8 @@ int main(int argc, char *argv[])
|
|||||||
// Start the game if successful
|
// Start the game if successful
|
||||||
// error message if some words couldn't be placed
|
// error message if some words couldn't be placed
|
||||||
|
|
||||||
|
startGame(wordSalad, SALAD_SIZE, words, wordCount, 600);
|
||||||
|
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
|
|||||||
@@ -4,7 +4,8 @@ _Vorgegebene Anweisung:_
|
|||||||
Wörter aus der Wortliste zufällig horizontal oder vertikal plazieren, restliche Felder mit zufälligen Buchstaben füllen
|
Wörter aus der Wortliste zufällig horizontal oder vertikal plazieren, restliche Felder mit zufälligen Buchstaben füllen
|
||||||
#### input.c
|
#### input.c
|
||||||
_Vorgegebene Anweisung:_
|
_Vorgegebene Anweisung:_
|
||||||
eine Funktion implementierenm die ein einzelnes Wort aus einer Textdatei (words.txt) einliest und als C-String zurückgibt
|
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
|
#### main.c
|
||||||
_Vorgegebene Anweisung:_
|
_Vorgegebene Anweisung:_
|
||||||
Check if all words were successfully placed
|
Check if all words were successfully placed
|
||||||
|
|||||||
Reference in new issue
Block a user