generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
37 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 195ce39698 | |||
| 8bff068cee | |||
| ff8384e9ee | |||
| cbf834ab76 | |||
| 249298afc6 | |||
| 6d8371d487 | |||
| 20465e1dc2 | |||
| 80dac61be4 | |||
| 99a0600fd2 | |||
| e8ba3293a6 | |||
| 16134abad0 | |||
| 9ab08b84f6 | |||
| 36b117b57e | |||
| 71db293343 | |||
| 256be70364 | |||
| c316d20fa1 | |||
| 31ed3191de | |||
| 80e6bd2b05 | |||
| 983d35c825 | |||
| 17f86eeb71 | |||
| aaa6721f1c | |||
| 0be4a141c7 | |||
| 2b8775fdda | |||
| 650917b365 | |||
| b8f395aedb | |||
| aa61e44a0e | |||
| 994ec48f9e | |||
| d0dd0b0892 | |||
| 60f27b7db7 | |||
| e19dddf91d | |||
| 51b54badda | |||
| 6adbaf539e | |||
| f3b58a6150 | |||
| 0b1aa615e7 | |||
| 328931806c | |||
| 111d1ce238 | |||
| 1fb5db8a4f |
@ -2,123 +2,125 @@
|
||||
#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 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;
|
||||
int added = 0; // = 1 wäre Wort hinzugefügt
|
||||
int space = 0; // = 1 wäre Wort zu lang für diese Stelle
|
||||
unsigned long long wordLength = 0;
|
||||
|
||||
srand(time(NULL));
|
||||
int placedWords = 0;
|
||||
|
||||
// Array mit . füllen
|
||||
for (int r = 0; r < searchFieldLen; r++){
|
||||
for(int s = 0; s < searchFieldLen; s++){
|
||||
salad[r][s] = '.';
|
||||
for (int i = 0; i < searchFieldLen; i++)
|
||||
{
|
||||
for (int j = 0; j < searchFieldLen; j++)
|
||||
{
|
||||
salad[i][j] = '.'; //Füllen des gesamten Arrays mit '.'
|
||||
}
|
||||
}
|
||||
|
||||
// -> erst wenn die ganze Länge des Wortes frei ist, array hinzufügen
|
||||
// MAX Versuche das Wort zu platzieren == 10
|
||||
|
||||
for (int i=0; i < wordCount; i++)
|
||||
{
|
||||
|
||||
// Wörter in salad einsortieren
|
||||
for (int num_words = 0; num_words < wordCount; num_words++){
|
||||
|
||||
int laenge = strlen(words[num_words]);
|
||||
|
||||
// muss noch prüfen, ob in der Zeile schon was ist
|
||||
// 1 ist horizontal, 0 ist vertikal
|
||||
// isalpha == 0 -> kein Buchstabe
|
||||
wordLength = strlen(words[i]);
|
||||
|
||||
for(int versuch = 0; versuch < MAX_RAND_TRIES_PER_WORD; versuch++){
|
||||
int richtung = rand()% 2;
|
||||
int belegt = 0;
|
||||
while (attempts <= MAX_RAND_TRIES_PER_WORD && added != 1)
|
||||
{
|
||||
int direction = rand() % 2;// 0 = Horizontal, 1 = Vertikal
|
||||
if (direction == 0) //Horizontal
|
||||
{
|
||||
int spalte = rand() % searchFieldLen;
|
||||
int reihe = rand() % searchFieldLen;
|
||||
for (int j = 0; j < wordLength; j++)
|
||||
{
|
||||
if (salad[reihe][spalte+j] != '.') //Prüfen das Wort mit einem anderem Wort überlappen würde
|
||||
{
|
||||
space = 1;
|
||||
break;
|
||||
}
|
||||
|
||||
}
|
||||
if ((spalte + wordLength >= searchFieldLen-1) || (space == 1)) // überprüfung, ob das Wort an der Stelle ins Array passt
|
||||
{
|
||||
attempts++;
|
||||
}
|
||||
|
||||
// horizontale Eingabe
|
||||
if (richtung == 1){
|
||||
int zeile = rand()% searchFieldLen;
|
||||
int spalte = rand()% (searchFieldLen- laenge +1);
|
||||
|
||||
//prüft, ob die herausgesuchte Zeile noch frei ist
|
||||
// belegt == 1 -> Zeile nicht frei
|
||||
for (int o = spalte; o < spalte + laenge; o++){
|
||||
if(salad[zeile][o] != '.'){
|
||||
belegt = 1;
|
||||
else
|
||||
{
|
||||
for (int j = 0; j < wordLength; j++)
|
||||
{
|
||||
salad[reihe][spalte+j] = words[i][j]; //Einfügen er Chars des Wortes
|
||||
}
|
||||
added=1;
|
||||
addedWords++;
|
||||
}
|
||||
}
|
||||
else if (direction == 1) // Vertikal
|
||||
{
|
||||
int spalte = rand() % searchFieldLen;
|
||||
int reihe = rand() % searchFieldLen;
|
||||
for (int j = 0; j < wordLength; j++)
|
||||
{
|
||||
if (salad[reihe+j][spalte] != '.')
|
||||
{
|
||||
space = 1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
// setzt in das Array ein, wenn frei oder erhöht die Versuchsanzahl
|
||||
if (belegt == 0){
|
||||
for(int k = 0; k < laenge; k++){
|
||||
salad[zeile][spalte + k] = words[num_words][k];
|
||||
|
||||
}
|
||||
placedWords++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
// vertikale Eingabe
|
||||
else if (richtung == 0){
|
||||
|
||||
int zeile = rand()% (searchFieldLen - laenge +1);
|
||||
int spalte = rand()% searchFieldLen;
|
||||
|
||||
//prüft, ob die herausgesuchte Zeile noch frei ist
|
||||
for (int n = zeile; n < zeile + laenge; n++){
|
||||
if(salad[n][spalte] != '.'){
|
||||
belegt = 1;
|
||||
break;
|
||||
}
|
||||
if ((reihe + wordLength >= searchFieldLen-1) || (space == 1))
|
||||
{
|
||||
attempts++;
|
||||
}
|
||||
// setzt in das Array ein, wenn frei oder erhöht die Versuchsanzahl
|
||||
if (belegt == 0){
|
||||
for(int j = 0; j < laenge; j++){
|
||||
salad[zeile + j][spalte] = words[num_words][j];
|
||||
|
||||
|
||||
|
||||
else
|
||||
{
|
||||
for (int j = 0; j < wordLength; j++)
|
||||
{
|
||||
salad[reihe+j][spalte] = words[i][j];
|
||||
}
|
||||
placedWords++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
else{
|
||||
break;
|
||||
added=1;
|
||||
addedWords++;
|
||||
}
|
||||
}
|
||||
space = 0;
|
||||
}
|
||||
|
||||
attempts = 0;
|
||||
added = 0;
|
||||
}
|
||||
|
||||
// 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;
|
||||
for (int i = 0; i < searchFieldLen; i++)
|
||||
{
|
||||
for (int j = 0; j < searchFieldLen; j++)
|
||||
{
|
||||
if (salad[i][j] == '.')
|
||||
{
|
||||
salad[i][j] = rand()%('Z'-'A'+1)+'A';//Zufällige Befüllung der noch nicht befüllten Felder
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return placedWords;
|
||||
}
|
||||
return addedWords;
|
||||
}
|
||||
|
||||
// Prints the word salad to console
|
||||
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
|
||||
{
|
||||
for(int p = 0; p < searchFieldLen; p++){
|
||||
for(int q = 0; q < searchFieldLen; q++){
|
||||
printf("%c", salad[p][q]);
|
||||
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
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Binary file not shown.
BIN
Start_Windows/graphicalGame.o
Normal file
BIN
Start_Windows/graphicalGame.o
Normal file
Binary file not shown.
Binary file not shown.
@ -38,17 +38,19 @@ int main(int argc, char *argv[])
|
||||
|
||||
// TODO:
|
||||
// Check if all words were successfully placed
|
||||
if(wordCount == placedWords)
|
||||
{
|
||||
exitCode = EXIT_SUCCESS;
|
||||
startGame(wordSalad,SALAD_SIZE, words,wordCount,750);
|
||||
}
|
||||
else
|
||||
{
|
||||
exitCode = EXIT_FAILURE;
|
||||
printf("Error. The words couldn't be placed.\n");
|
||||
}
|
||||
// Start the game if successful
|
||||
// error message if some words couldn't be placed
|
||||
if (placedWords == wordCount){
|
||||
startGame(wordSalad,SALAD_SIZE,words, wordCount,750);
|
||||
}
|
||||
else
|
||||
{
|
||||
printf("Error. The words couldn't be placed.\n");
|
||||
return -1;
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
else
|
||||
{
|
||||
|
||||
BIN
Start_Windows/main.o
Normal file
BIN
Start_Windows/main.o
Normal file
Binary file not shown.
@ -46,4 +46,5 @@ clean:
|
||||
#hier eigene wordsalad kopieren, library rauslassen
|
||||
|
||||
wordsalad_myversion: main.o input.o game.o graphicalGame.o
|
||||
$(CC) $(CFLAGS) -o wordsalad main.o input.o game.o graphicalGame.o $(BINARIES)/libraylib.a $(LDFLAGS)
|
||||
$(CC) $(CFLAGS) -o wordsalad main.o input.o game.o graphicalGame.o $(BINARIES)/libraylib.a $(LDFLAGS)
|
||||
|
||||
|
||||
Binary file not shown.
@ -1 +0,0 @@
|
||||
Hund,Katze; Maus
|
||||
@ -1,3 +0,0 @@
|
||||
Apfel
|
||||
Banane
|
||||
Kiwi
|
||||
Binary file not shown.
Binary file not shown.
BIN
Start_Windows/wordsalad.exe
Normal file
BIN
Start_Windows/wordsalad.exe
Normal file
Binary file not shown.
Loading…
x
Reference in New Issue
Block a user