Skip to content

Genetic algorithm implementation for maze solving

Notifications You must be signed in to change notification settings

lucbarr/theseus

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

theseus

Genetic algorithm implementation for maze solving.

Instructions

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

About

Genetic algorithm implementation for maze solving

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published