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 19

Browse Source
This commit is contained in:
Alexei Keller 2025-11-10 12:49:50 +01:00
parent 16134abad0
commit e8ba3293a6
1 changed files with 99 additions and 69 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

168
Start_Windows/game.c
View File

@ -2,98 +2,128 @@
#include <time.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define MAX_RAND_TRIES_PER_WORD 10
#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
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
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;
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));
for (int i = 0; i < searchFieldLen; i++) {
for (int j = 0; j < searchFieldLen; j++) {
salad[i][j] = EMPTY_CHAR; //Füllen des gesamten Arrays mit Nullen
int placedWords = 0;
unsigned int tries = 0;
unsigned int check_direction = 0, check_overlap = 0;
int zeile = 0, spalte = 0, len = 0;
//1. Schritt: Alle Felder mit 0 befüllen
for(int m = 0; m < searchFieldLen; m++) //m Zeilen
{
for(int n = 0; n < searchFieldLen; n++) //n Spalte
{
salad[m][n] = 0;
}
}
for (int i=0; i < wordCount; i++) {
// 2. Schritt: Prüfen ob Wort in Array geschrieben darf
for(int num_words = 0; num_words < wordCount && num_words < searchFieldLen; num_words++) //eingelesen Wörter zählen
{
len = strlen(words[num_words]); //Größe des Wortes ermitteln
wordLength = strlen(words[i]);
if (len < searchFieldLen)
return -1; //ERROR, falls Wort größer als Größe des Feldes (unnötig, da bei worteingabe bereits überprüft)
while (attempts <= MAX_RAND_TRIES_PER_WORD && added != 1) {
int direction = rand() % 2;// 0 Horizontal, 1 Vertikal
if (direction == 0) {
int collumn = rand() % searchFieldLen;
int row = rand() % searchFieldLen;
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)
while(tries < MAX_RAND_TRIES_PER_WORD)
{
// zufällige Richtung auswählen
int direction = rand() % 2; // 0 = VERTIKAL, 1 = HORIZONTAL
// zufälliger Startpunkt, Startkoordinaten
if (direction == 0) // 0 = VERTIKAL -> Spalte egal
{
salad[i][j] = rand()%('Z'-'A'+1)+'A';//Alle Felder, die noch nicht befüllt sind, werden zufällig befüllt
zeile = rand() % (searchFieldLen - len);
spalte = rand() % (searchFieldLen);
check_direction = 1;
}
if (direction == 1) // 1 = HORIZONTAL -> Zeile egal
{
zeile = rand() % (searchFieldLen);
spalte = rand() % (searchFieldLen - len);
check_direction = 1;
}
//Prüfen auf Überlappung ----------> Logikfehler
for(int i_overlap = 0; i_overlap < len; i_overlap++)
{
if (direction == 0) // 0 = VERTIKAL
{
if (words[num_words][i_overlap] == salad[zeile][spalte + i_overlap]);
check_overlap = 1;
}
else if (direction == 1) // 1 = HORIZONTAL
{
if (words[num_words][i_overlap] == salad[zeile + i_overlap][spalte]);
check_overlap = 1;
}
if(check_overlap == 0)
{
tries++;
break;
}
}
//3. Schritt: Wort in Wortsalat schreiben
if(check_direction == 1 && check_overlap == 1 && tries < MAX_RAND_TRIES_PER_WORD)
{
for(int i_set = 0; i_set < len; i_set++)
{
if (direction == 0) // 0 = VERTIKAL
{
salad[zeile + i_set][spalte] = words[num_words][i_set];
placedWords++;
}
if (direction == 1) // 1 = HORIZONTAL
{
salad[zeile][spalte + i_set] = words[num_words][i_set];
placedWords++;
}
}
}
}
}
return addedWords;
// fügt zufällige Buchstaben ein
for(int l = 0; l < searchFieldLen; l++){
for(int m = 0; m < searchFieldLen; m++ ){
if(isalpha(salad[l][m]) == 0 ){
// zufällige Buchstaben erzeugen
char alphabet [] = "abcdefghijklmnopqrstuvwxyz";
int laenge = strlen(alphabet);
int zufallszahl = rand()% laenge;
char zufallsbuchstabe = alphabet[zufallszahl];
// zufällige Buchstaben einfügen
salad[l][m] = zufallsbuchstabe;
}
}
}
return placedWords; //platzierte Wörter zurückgeben
}
// Prints the word salad to console
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]);//Ausgabe des Arrays auf die Konsole
for(int p = 0; p < searchFieldLen; p++){
for(int q = 0; q < searchFieldLen; q++){
printf("%c", salad[p][q]);
}
printf("\n");
}
}
}