Genetic algorithm implementation for maze solving.
The input maze map.txt must be typeset in such way that:
- '#' character means the maze's walls
- 'i' character means the maze's start
- '@' character means the maze's end
- '.' character means the maze's path
- 'x' character fills the maze's stepped into path
- The maze's borders must be filled with walls ('#')
- There preferably must exist a solution to the labyrinth
To run the program (Unix only, gcc required) :
~$ make
~$ ./theseus