herdingto103621/info2Praktikum-Wortsalat_Bernard_Herding
1
0 Fork 0
forked from freudenreichan/info2Praktikum-Wortsalat
Code Pull Requests Activity

game.c angefangen

Browse Source 
Startpunkte für worte raussuchen
This commit is contained in:
herdingto103621 committed 2026-10-26 15:28:53 +01:00
1 parent afdd93f035
commit ea276d358e
1 file changed
+110 -1
Download Patch File Download Diff File Expand all files Collapse all files
Startcode/game.c
+110 -1
View File
@@ -12,8 +12,117 @@
// Creates the word salad by placing words randomly and filling empty spaces
//test jonathan
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));
int startpoint_x, startpoint_y, direction, possible, tries;
for(int i = 0; i < MAX_SEARCH_FIELD_LEN; i++){
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++){
salad[i][j] = '0';
}
}
for(int i = 0; i < wordCount; i++){
possible = 0;
tries = 0;
while(possible == 0 && tries <= MAX_RAND_TRIES_PER_WORD){
direction = rand() % 4;
switch(direction){
case 0: //X-Positiv
startpoint_x = rand() % (searchFieldLen - strlen(words [i])) + 1;
startpoint_y = rand() % searchFieldLen;
for(int j = 0; j < strlen(words[i]); j++){
if(salad[startpoint_x + j][startpoint_y] != '0'){
possible = 0;
break;
}
else {
possible = 1;
}
}
if(possible = 0){
tries += 1;
break;
}
for(int j = 0; j < strlen(words[i]); j++){
salad[startpoint_x + j][startpoint_y] = Words[i][j]
}
break;
case 1: //X-Negativ
startpoint_x = searchFieldLen - rand() % (searchFieldLen - strlen(words [i])) + 1;
startpoint_y = rand() % searchFieldLen;
for(int j = 0; j < strlen(words[i]); j++){
if(salad[startpoint_x - j][startpoint_y] != '0'){
possible = 0;
break;
}
else {
possible = 1;
}
}
if(possible = 0){
tries += 1;
break;
}
for(int j = 0; j < strlen(words[i]); j++){
salad[startpoint_x - j][startpoint_y] = Words[i][j]
}
break;
case 2: //Y-Positiv
startpoint_x = rand() % searchFieldLen;
startpoint_y = rand() % (searchFieldLen - strlen(words [i])) + 1;
for(int j = 0; j < strlen(words[i]); j++){
if(salad[startpoint_x][startpoint_y + j] != '0'){
possible = 0;
break;
}
else {
possible = 1;
}
}
if(possible = 0){
tries += 1;
break;
}
for(int j = 0; j < strlen(words[i]); j++){
salad[startpoint_x ][startpoint_y + j] = Words[i][j]
}
break;
case 3: //Y-Negativ
startpoint_x = rand() % searchFieldLen;
startpoint_y = searchFieldLen - rand() % (searchFieldLen - strlen(words [i])) + 1;
for(int j = 0; j < strlen(words[i]); j++){
if(salad[startpoint_x][startpoint_y - j] != '0'){
possible = 0;
break;
}
else {
possible = 1;
}
}
if(possible = 0){
tries += 1;
break;
}
for(int j = 0; j < strlen(words[i]); j++){
salad[startpoint_x][startpoint_y - j] = Words[i][j]
}
break;
}
}
}
}