Mazes for Programmers

Longest Path

The longest path was computed using Dijkstra’s algorithm, as described in ​Making Challenging Mazes​. It is represented in the following figure as the percentage of cells in a maze that lie on that longest path.

Recursive Backtracker is far-and-away the champion here, with an average of 50% of the cells in the grid existing on the longest path. Simplified Prim’s falls at the other end of the spectrum, with longest paths that cover less than 10% of the grid.