Genetic algorithms in mazes : A comparative study of the performance for solving mazes between genetic algorithms, BFS and DFS.

Abstract: In this report, genetic algorithms were compared to BFS and DFS for solvingmazes with regards to computational time and solution path length. This wasdone by creating mazes with Wilson's algorithm and running several tests ina controlled environment. The solution path length found by the genetic algorithmwas in general better than the DFS and often almost as good as the onefound by the BFS. The computational time needed by the genetic algorithmhowever was signicantly worse than the time needed by both the DFS and theBFS.