Mazes for Programmers

Chapter 12Combining, Dividing

So many algorithms! From the Binary Tree and Sidewinder, to Kruskal’s and Prim’s and Growing Tree, you’ve learned a lot about the different methods of generating random mazes. Ten methods, to be precise—and eleven, if we’re counting Dijkstra’s.

There are only two more left to cover!

The first, called Eller’s algorithm, is a fast, efficient, and clever technique that seems born of the unlikely union of the Sidewinder algorithm and Kruskal’s.

The second is a unique algorithm called Recursive Division, which operates very differently from any of the others we’ve covered. Its fractal nature has some interesting consequences, which we’ll exploit to produce rooms in our mazes.

But first, Eller’s. Here we go!