Abstract
A maze is a collection of walls and spaces arranged in such a way that they form a path/paths commonly connecting an entry point to a goal. There are various kinds of maze solving algorithms. These methods are used in practice to help navigate an autonomous system to find a path within maze to find a target such as an exit point, special item, or location to the next level. This research explored two maze solving algorithms: Hand/Wall Follower and Dead-End Filler. Experiments were conducted to measure the time needed for each algorithm in solving 50 perfect mazes of various sizes. The result showed that Hand/Wall Follower algorithm is faster than Dead End Filler algorithm; for example, in solving 800 x 800 cell mazes, the former required an average time of 98.74 milliseconds while the later needed 215.86 milliseconds.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call