{
  jazero
}
{ vypis z kazdej n-tej generacie }
*PRINT_EVERY = 50
{ maximalna dlzka na zaciatku generovanych programov }
*PROGRAM_INIT_MAX_LENGTH = 7
{ maximalna dlzka stromu programu }
*PROGRAM_MAX_LENGTH = 20
{ maximalny pocet krokov programu, po ktorych sa vypocita
  fitness }
*PROGRAM_MAX_STEPS = 100

{ velkost generacie } 
*GENERATION_SIZE = 25
{ maximalny pocet behu, generacii }
*GENERATIONS_MAX = 2000

{ vyberanie jedincov do dalsej generacie
  jedna z moznosti: BEST, RAND, T
  BEST - best
  RAND - random
  T - tournament }
*GENERATION_NEXT = "T"

{ vyberanie jedincov do mating pool
  jedna z moznosti: RAND, T
  RAND - random
  T - tournament }
*MATING_POOL_SELECTION = "T"
*CROSSOVER_PROBABILITY = 0.4

{ maximalna vyska stromu programu, ktory sa vygeneruje
  ako nahradnik v mutacii }
*MUTATION_PROGRAM_MAX_LENGHT = 6
*MUTATION_PROBABILITY = 0.18

{ rozmery hracej plochy }
*GRID_SIZE_XY = 20 13
{ poloha startu a cielu, pocita sa od 0 po max-1 }
*START_XY = 0 0
*END_XY = 100 100

*GRID ={
S.......0..........0
.......0.0..........
....................
....................
.......0000.........
.0....000000......0.
0.....0000000......0
.0....000000......0.
........000.........
....................
....................
........0.0.........
0........0.........E}