The depth first search algorithm

The depth first seach is an intuitive method of searching a maze. Basically, the mouse simply starts moving. When it comes to an intersection in the maze, it randomly chooses one of the paths. If that path leads to a dead end, the mouse backtracks to the intersection and chooses another path. This forces the robot to explore every possible path within the maze. By exploring every cell within the maze the mouse will eventually find the center.

Obviously, exploring the entire maze is not an efficient way of solving it. Also, this method finds a route but it doesn't necessarily find the quickest or shortest route to the center.

Summary:

This algorithm wastes too much time exploring the entire maze.