ZinZam

Maze Solving

Maze solving is conducted using a path finding algorithm. There are many such as depth first, breadth first, greedy, A*, and even biologically inspired algorithms. It may be interesting to experiment with a couple, but when it boils down to it, micromouse is a competition, so you should pick the best. Given A* is mathematically optimal.

A* is slow, but there is a well documented case of A* used in building micromouse which is a lot faster known as flood-fill. Even then flood fill is slow for exploring the maze and can cost you time during the competition, so often the much faster fast flood-fill is used during exploring, and then flood fill is used once a goal has been reached and a new goal is to be calculated.