Maze | Maze-solving algorithms

Maze is a Python library. Maze has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. However Maze build file is not available. You can download it from GitHub.

Mazes have long been a staple of computer science, from Dijkstra's famous algorithm to early AI experiments in Wumpus World. Most of these experiments, however, assume a rather unrealistic kind of maze. For example, Dijkstra's algorithm requires visibility of the entire maze, Trémaux's requires the ability to make marks on the ends of tunnels, and several require a concept of orientation, and knowledge of the direction of the exit. Real mazes are not like that. The rat walking round the maze initially sees a number of identical tunnels stretching away in different directions. She chooses a tunnel and walks to the next chamber, which again gives a choice of identical tunnels. There is no way of identifying tunnels, chambers or directions, and she just staggers from junction to junction until she emerges into the sunlight. Some computer game mazes, such as Zork, are even worse. They have non-bidirectional tunnels, where walking back along the same tunnel takes you somewhere different. We only think about well-behaved mazes, which are properly bidirectional. We also only consider mazes that have at most one tunnel between any two chambers. This makes the mazes roughly the equivalent of bidirectional graphs, in mathematical terms. The difference is that in a maze the order of tunnels around a chamber is important, and fixed.