This wiki provides general information on maze solving techniques in Python.

The original implementation is by Dr Mike Pound to support the Maze Solving video on the Computerphile YouTube channel. You should view the video before proceeding further.

The code provides examples of maze solving using a variety of algorithms, including:

• Dijkstra. See Also: Wikipedia page, YouTube video
• A*. See also: Wikipedia page, YouTube video
• Depth first traversal
• Breadth first traversal
• Left turn (a trivial approach)

There is a Python interface to the Daedalus maze generation software called pydaedalus, available on PyPI.

If you're interested in sharing enhancements, consider making a fork and mentioning it on the forks page.