Binary Tree Maze Generation
Binary Tree AlgorithmThis is a very easy to implement maze, though it does produce a "bias" in a particular diagonal direction. Moving from left to right across each row, and from top to bottom, a single wall is removed from each cell, either to the east or south. This algorithm can also be adapted to a north/west, north/east, or south/east configuration, beginning at an appropriate corner.
This applet was last updated July 2019.