Realization of depth first search algorithm on line maze solver robot

Abstract

In this paper, described depth first search algorithm being implemented on line maze solver robot. Right hand rule will be used to select the turn priority. Some mazes will be used to test the reliability of this depth first search maze solver robot. In the result, the system is able to use depth first search algorithm well. The robot able to finish non-loop maze with 84.97 s average time and with-loop maze in 63,4 s average time. But, the robot fails to finish in the maze with-loop where the finish is located at the non-priority turn and the next junction is loop.