#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 placedWords = 0;
   unsigned int succesfully_placed = 0;
   unsigned int tries = 0;
   unsigned int check_direction = 0, check_overlap = 0;
   int zeile = 0, spalte = 0, len = 0;
   
   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
   {
      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
         if (direction == 0)  // 0 = VERTIKAL -> Spalte egal
         {
             zeile = rand() % (searchFieldLen - len); 
             spalte = rand() % (searchFieldLen);
             check_direction = 1;
         }

         if (direction == 1)  // 1 = HORIZONTAL -> Zeile egal
         {
            int zeile = rand() % (searchFieldLen); 
            int spalte = rand() % (searchFieldLen - len);
            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];
                  placedWords++;
                  }

                  if (direction == 1)  // 1 = HORIZONTAL 
                  {
                  salad[zeile][spalte + i_set] = words[num_words][i_set];
                  placedWords++;
                  }
               }
            }
      }
   }
   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)
{

}