Comparative analysis of algorithms to search for the shortest path in a maze
Milena Karova, Ivaylo Plamenov Penev, Neli Kalcheva · 2016
The aim of the paper is research and comparative analysis of algorithms from the field of artificial intelligence for searching shortest path in a maze. The algorithms studied are A* (A star), backtracking algorithm and genetic algorithm (GAPP - Genetic Algorithm Path Planning). The algorithms are compared by two criteria: length of the found path and time for finding the path. The results, presented analytically and graphically, show the application of the three algorithms for mazes with various size and number of obstacles.