grafma98967/info_2_wortsalat
0
0
Fork 0
generated from freudenreichan/info2Praktikum-Wortsalat
Code Issues Pull Requests 1 Actions Packages Projects Releases Wiki Activity

test 23

Browse Source
This commit is contained in:
Alexei Keller 2025-11-10 14:13:31 +01:00
parent 20465e1dc2
commit 6d8371d487
1 changed files with 97 additions and 68 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

165
Start_Windows/game.c
View File

@ -2,98 +2,127 @@
#include <time.h> #include <time.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include <ctype.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 */
// 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)
int addedWords = 0; {
int attempts = 0; //Anzahl an Versuchen ein Wort hinzuzufügen srand(time(NULL));
int added = 0; //0 Wort nicht hinzugefügt , 1 Wort hinzugefügt
int space = 1; // 0 Wort zu lang, 1 Wort passt an diese Stelle
unsigned long long wordLength = 0;
for (int i = 0; i < searchFieldLen; i++) { int placedWords = 0;
for (int j = 0; j < searchFieldLen; j++) { unsigned int attemps = 0;
salad[i][j] = EMPTY_CHAR; //Füllen des gesamten Arrays mit Nullen unsigned int check_overlap = 0;
int zeile = 0, spalte = 0, len = 0;
//Alle Felder mit ? befüllen
for(int m = 0; m < searchFieldLen; m++) //m Zeilen
{
for(int n = 0; n < searchFieldLen; n++) //n Spalte
{
salad[m][n] = '?';
} }
} }
for (int i=0; i < wordCount; i++) {
//Prüfen ob Wort in Array geschrieben darf
for(int num_words = 0; num_words < wordCount; num_words++) //eingelesen Wörter zählen
{
len = strlen(words[num_words]); //Größe des Wortes ermitteln
wordLength = strlen(words[i]); while(attemps < MAX_RAND_TRIES_PER_WORD)
{
while (attempts <= MAX_RAND_TRIES_PER_WORD && added != 1) { // zufällige Richtung auswählen
int direction = rand() % 2;// 0 Horizontal, 1 Vertikal int direction = rand() % 2; // 0 = VERTIKAL, 1 = HORIZONTAL
if (direction == 0) {
int collumn = rand() % searchFieldLen; // zufälliger Startpunkt, Startkoordinaten
int row = rand() % searchFieldLen; if (direction == 0) // 0 = VERTIKAL
for (int j = 0; j < wordLength; j++)
{
if (salad[row][collumn+j] != EMPTY_CHAR) {space = 0; break;}
//Prüfen ob das Wort ein bereits vorhandenes Wort überspeichern würde
}
if ((collumn + wordLength >= searchFieldLen-1) || (space == 0)) {attempts++;}
//Prüfen ob Wort an der Stelle (Zeile, Spalte) in das Array passt
else {for (int j = 0; j < wordLength; j++)
{
salad[row][collumn+j] = words[i][j]; //Einfügen des Wortes Buchstabe für Buchstabe
}
added=1;
addedWords++;
}
}
else if (direction == 1) {// Vertikal funktioniert analog zu horizontal
int collumn = rand() % searchFieldLen;
int row = rand() % searchFieldLen;
for (int j = 0; j < wordLength; j++)
{
if (salad[row+j][collumn] != EMPTY_CHAR) {space = 0; break;}
}
if ((row + wordLength >= searchFieldLen-1) || (space == 0)) {attempts++;}
else {
for (int j = 0; j < wordLength; j++)
{
salad[row+j][collumn] = words[i][j];
}
added=1;
addedWords++;
}
}
space = 1;
}
attempts = 0;
added = 0;
}
for (int i = 0; i < searchFieldLen; i++) {
for (int j = 0; j < searchFieldLen; j++) {
if (salad[i][j] == EMPTY_CHAR)
{ {
salad[i][j] = rand()%('Z'-'A'+1)+'A';//Alle Felder, die noch nicht befüllt sind, werden zufällig befüllt zeile = rand() % searchFieldLen;
spalte = rand() % searchFieldLen;
} }
if (direction == 1) // 1 = HORIZONTAL
{
zeile = rand() % searchFieldLen;
spalte = rand() % searchFieldLen;
}
for(int i = 0; i < len; i++)
{
if (direction == 0) // 0 = VERTIKAL
{
//Prüfe ob Feld bereits belegt
if (salad[zeile+i][spalte] != '?')
{
check_overlap = 1; // 1 = Überlappung
break;
}
//Prüfe auf Groeße
if (spalte + len >= searchFieldLen-1 || check_overlap == 1)
{
attemps++;
}
else
{
for(int k; k < len; k++)
{
salad[zeile][spalte+k] = words[i][k];
placedWords++;
}
}
}
if (direction == 1) // 1 = HORZIZONTAL
{
//Prüfe ob Feld bereits belegt
if (salad[zeile][spalte+i] != '?')
{
check_overlap = 1; // 1 = Überlappung
break;
}
//Prüfe auf Groeße
if (zeile + len >= searchFieldLen-1 || check_overlap == 1)
{
attemps++;
}
else
{
for(int k; k < len; k++)
{
salad[zeile+k][spalte] = words[i][k];
placedWords++;
}
}
}
}
} }
} }
return addedWords; return placedWords; //platzierte Wörter zurückgeben
} }
// 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 p = 0; p < searchFieldLen; p++)
{ {
for(int j = 0; j < searchFieldLen; j++) for(int q = 0; q < searchFieldLen; q++)
{ {
printf("%c", salad[i][j]);//Ausgabe des Arrays auf die Konsole printf("%c", salad[p][q]);
} }
printf("\n");
} }
} }