Labs / Computer Science
Maze Generation
A maze tunnels itself into existence one corridor at a time. Pick an algorithm and watch the walls fall, then press Solve — or click and drag anywhere in the grid — to chase a shortest path from that cell down to the exit in the bottom-right corner.
Carving…carved 0 / 0path —
What to try
- The backtracker digs long, winding tunnels; Prim spreads out from a seed. Which one leaves you with more dead ends?
- Click a cell right next to the exit, then one far away. How does the solution length change with distance across the grid?
- Crank the grid up to 40×40. Does the solver still find the one true path through thousands of cells?
- Slow the speed right down. Can you predict which wall the carver will punch through next, or is it truly random?
- Between any two cells in a finished maze, how many different routes exist — one, or many?