Repository files navigation

This project provides Java implementations of more than 35 algorithms for generating so called "perfect mazes" (which are just spanning trees of undirected graphs).

The shown demo application can be downloadedhere. (Java runtime needed.)

cd <your_root_dir>git clone https://github.com/armin-reichert/graph.gitgit clone https://github.com/armin-reichert/mazes.gitcd graphmvn clean installcd ../mazesmvn clean install

cd <your_root_dir>git clone https://github.com/armin-reichert/mazes-demos.gitcd mazes-demos/SwingMazeDemomvn clean install

Then you find an executable jar file namedSwingMazeDemo-1.0-jar-with-dependencies.jar inside the foldertarget.

On the web, many maze generation implementations in all possible programming languages can be found. The popularity of these algorithms probably comes from the fact that mazes and their creation processes are visually appealing and not really difficult to implement. The most popular algorithm seems to be "recursive backtracking" which is random depth-first traversal of a graph.

On the other hand, there are only a few websites where the whole spectrum of maze creation algorithms is investigated. One prominent example isthis blog where Jamis Buck presents the most popular maze algorithms together with Ruby/Javascript implementations. Reading his blog led myself to investigate this topic too.

Read more...