generated from freudenreichan/info2Praktikum-Wortsalat
119 lines
3.8 KiB
C
119 lines
3.8 KiB
C
#include "game.h"
|
|
#include <time.h>
|
|
#include <stdlib.h>
|
|
#include <string.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)
|
|
{
|
|
srand(time(NULL));
|
|
|
|
//1. Schritt: Alle Felder mit 0 befüllen
|
|
int size_word;
|
|
int placed_words = 0;
|
|
unsigned int succesfully_placed = 0;
|
|
unsigned int tries = 0;
|
|
unsigned int check_direction = 0, check_overlap = 0;
|
|
int zeile, spalte;
|
|
|
|
for(int m = 0; m < searchFieldLen; m++) //m Zeilen
|
|
{
|
|
for(int n = 0; n < searchFieldLen; n++) //n Spalte
|
|
{
|
|
salad[m][n] = 0;
|
|
}
|
|
}
|
|
|
|
// 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
|
|
{
|
|
size_t len = strlen(words[num_words]); //Größe des Wortes ermitteln
|
|
|
|
if (len < searchFieldLen)
|
|
return -1; //ERROR, falls Wort größer als Größe des Feldes (unnötig, da bei worteingabe bereits überprüft)
|
|
|
|
while(succesfully_placed == 0 && tries < MAX_RAND_TRIES_PER_WORD)
|
|
{
|
|
// zufällige Richtung auswählen
|
|
int direction = rand() % 2; // 0 = VERTIKAL, 1 = HORIZONTAL
|
|
|
|
// zufälliger Startpunkt, Startkoordinaten
|
|
for(int i = 0; i < wordCount; i++)
|
|
{
|
|
if (direction == 0) // 0 = VERTIKAL -> Spalte egal
|
|
{
|
|
for(int j = 0; j < len; j++)
|
|
{
|
|
zeile = rand() % (searchFieldLen - len);
|
|
spalte = rand() % (searchFieldLen);
|
|
salad[zeile][spalte] = words[j];
|
|
check_direction = 1;
|
|
}
|
|
}
|
|
|
|
if (direction == 1) // 1 = HORIZONTAL -> Zeile egal
|
|
{
|
|
for(int k = 0; k < len; k++)
|
|
{
|
|
int zeile = rand() % (searchFieldLen);
|
|
int spalte = rand() % (searchFieldLen - len);
|
|
salad[zeile][spalte] = words[k];
|
|
check_direction = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
//Prüfen auf Überlappung
|
|
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)
|
|
break;
|
|
}
|
|
|
|
//3. Schritt: Wort in Wortsalat schreiben
|
|
if(check_direction == 1 && check_overlap == 1)
|
|
{
|
|
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];
|
|
placed_words++;
|
|
}
|
|
|
|
if (direction == 1) // 1 = HORIZONTAL
|
|
{
|
|
salad[zeile][spalte + i_set] = words[num_words][i_set];
|
|
placed_words++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return placed_words; //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)
|
|
{
|
|
|
|
}
|
|
|