Generating Mazes with Three Algorithms
SMRTR summary
Three maze generation algorithms are explored: Aldous Broder (unbiased but inefficient), Random Depth-First Search (efficient but creates long corridors), and Wilson's Algorithm (unbiased with better performance). Each algorithm creates perfect mazes where exactly one path exists between any two cells, with start and end points determined by finding the two furthest cells using breadth-first searches.
SMRTR provides this summary for quick context. The original article belongs to lobste.rs.
Read the original article