Mazes for Programmers

Growing Tree

In a nutshell:

This algorithm is a generalization of the Prim’s algorithms. Start by creating a set and adding an arbitrary cell to it. Then, choose a cell from the set. If the cell has no unvisited neighbors, remove it from the set; otherwise choose one of the unvisited neighbors and link the two together. Add the neighbor to the set. Repeat until the set is empty.

Typical features:

Depends heavily on the method used to choose the next cell from the set. Mazes may be radially textured (like Simplified Prim’s) or twisted and snaky (like Recursive Backtracker), or anything in-between.

Variations:

Alter the way in which cells are selected ...