Maze Algorithms (1997)
Summary
A comprehensive overview of maze classifications, generation algorithms, solving techniques, and related concepts. It covers a wide range of methods (perfect, braid, unicursal, recursive backtracking, Kruskal, Prim, Eller’s, Wilson, etc.) and discusses metrics such as dead ends, memory usage, texture, and uniformity, with practical notes and sample implementations.