Mazes for Programmers

Prim’s (True)

In a nutshell:

First, assign every cell a random weight, and initialize a set with an arbitrary cell. Choose the cell with the greatest weight from the set. If it has no unvisited neighbors, remove it from the set. Otherwise, choose one of the cell’s unvisited neighbors, link the two together, and add the neighbor to the set. Repeat until the set is empty.

Typical features:

Many, many dead ends per maze, with relatively shorter paths in general. Texture-wise, the mazes have a “jigsaw puzzle” appearance.

More information:

​True Prim’s Algorithm​.