Open AccessComparison of Hand Follower and Dead-End Filler Algorithm in Solving Perfect Mazes
Author(s) -
Yonathan Fery Hendrawan
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1569/2/022059
Subject(s) - path (computing) , point (geometry) , end point , computer science , algorithm , dead end , measure (data warehouse) , mathematics , real time computing , geometry , data mining , flow (mathematics) , programming language
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.