Generate mazes of different shapes and arbitrary sizes using graph theory
-
Updated
Apr 15, 2022 - C++
A maze is a type of puzzle involving a collection of paths, usually where a player has to find a route from start to finish.
A huge variety of algorithms exist for generating and solving mazes. These are not only fun to implement, but also are a good way to familiarise yourself with programming techniques, algorithms, and languages.
The generator unit tests are pretty good. But they need one more test feature for each generator type: test if the maze is solvable?
One way to solve this would be to put a start and end point in the corner of the maze and solve it.
This is easy in theory, but not all mazes are solvable using the same solving Algorithm.
The
Boundgame has 12 levels at the moment. It would be nice to add more.