Review of Maze Solving Algorithms for 2D Maze and Their Visualisation

Abstract

The aim of this article is to describe algorithms that can be used to solve labyrinth, and more particularly 2D maze. This includes algorithms specifically created for this task as well as algorithms for finding the shortest path in a graph. They include simple rules possible to use inside labyrinth such as Random Mouse and Wall Follower, algorithms that can be used outside like Dead end filler and a few other that can’t be reliably used by human because of more complex calculations, for example: Recursive backtracker algorithm. The own software was prepared for visualisation of these algorithms as well as for random generation of proper, solvable 2D mazes.