Mazes

Experiment with programmatic maze generation featuring animated visualization.

Legend

start point - top left

end point - center of maze

shortest path between start and end points

current cell being processed (during animation)

cells being explored during pathfinding

Controls

Steps Per Frame:3

💡 Tip: You can adjust steps in real-time during animation

How It Works

Here is how it works:

Start with a grid that has every possible wall filled in.
Choose a cell to start from.
From your current cell, choose a random neighbor that you haven't visited before and move to that cell, knocking down the wall between them.
If there are no unvisited neighbors, backtrack to the previous cell you were in and repeat.
Otherwise, repeat from your new cell.

References