Online Maze Generator

A 15×15 grid maze can contain hundreds of branches while preserving one unique, non-repeating path from start to finish. The generator above lets you control the width, height, algorithm, exit layout, and random seed, then use the result for online play, classroom demonstrations, or printable maze worksheets.

How Mazes Are Generated

A grid maze can be modeled as a graph of cells and passages. Each cell represents a node, while the walls between adjacent cells determine whether those nodes are connected. The process begins with every wall in place, then progressively opens passages between neighboring cells according to the selected algorithm. The result is a spanning tree that reaches every cell. This structure ensures that every pair of cells is connected and that the solution contains no loops. The generator uses a deterministic pseudorandom sequence for identical inputs, so the same seed produces the same walls, start, finish, and shortest path.

Setting the Size, Algorithm, and Seed

1. Enter integers from 5 to 50 in “Width (cells)” and “Height (cells).” Smaller mazes work well for mobile play, while sizes of 20×20 or larger are better suited to printing.
2. Choose Recursive Backtracker, Randomized Prim, or Randomized Kruskal under “Generation Algorithm.” The algorithm changes the passage pattern, but all three always create a solvable maze.
3. Select Left to Right, Top to Bottom, or Longest Path. The first two place the entrance and exit on opposite edges, while “Longest Path” prioritizes a pair of endpoints farther apart.
4. To reproduce a maze, enter letters or numbers under “Random Seed.” Leave it blank to create a new seed whenever you click “Generate New Maze.”
5. After generating the maze, you can show the shortest path or distance heatmap, start playing, or download an SVG.

How the Three Algorithms Differ

Algorithm	Passage Pattern	Best For
Recursive Backtracker	Prominent long corridors, fewer consecutive turns, and typically deep dead ends	First-time solvers and a smooth puzzle-solving flow
Randomized Prim	Dense short branches and junctions with an even overall distribution	Visualizing distance spread and creating medium-difficulty exercises
Randomized Kruskal	Gradually merges many small regions, producing a balanced path distribution	Printable puzzles, algorithm lessons, and structural comparisons

For example, in a 20×20 maze, Recursive Backtracker often creates long corridors that cross large areas. Randomized Prim looks more like branches growing outward in several directions, while Randomized Kruskal produces more dispersed local structures. You can keep the same size and seed while switching algorithms to compare their visual patterns and solving pace.

How Exit Layout Affects Difficulty

Left-to-right mode places the start and finish on the maze’s side edges, while top-to-bottom mode uses the upper and lower edges. Both work well for worksheets with a clear orientation. “Longest Path” does not simply add more walls. Instead, it analyzes passage distances after generation and selects endpoints farther apart, making the solution cover more cells. Difficulty still depends on the algorithm, maze size, and how the player scans the puzzle, so shortest-path length is a better measure of the actual route than canvas size alone.

The shortest path through a 10×10 maze might be only 25 moves or more than 50. The result heading displays the maze size and minimum move count, letting you see route-length changes immediately after switching the exit layout. For a more complex puzzle, increase the size and then select “Longest Path” instead of repeatedly generating mazes at the same dimensions.

Reading the Shortest Path and Distance Heatmap

“Show Shortest Path” draws the unique solution from the starting point. Use it to check an answer, explain pathfinding algorithms, or create worksheets with answer keys. “Show Distances” colors each cell according to its shortest distance from the start, revealing how the search expands outward. The heatmap does not represent the player’s route and does not alter any walls; hiding it leaves the maze unchanged.

In a classroom, you can begin with the solution hidden and ask students to find the exit manually. Then reveal the shortest path to check their work and enable the distance heatmap to discuss how breadth-first search visits cells layer by layer. Because the maze contains no loops, each cell has exactly one path from the start, giving every distance value a unique meaning.

Play Online and Download as SVG

Click “Start Playing,” then move with the arrow keys or WASD. On phones and tablets, use the on-screen directional controls. The status area tracks your moves and elapsed time, and a completion message appears when you reach the finish. “Restart” returns the player to the starting point without regenerating the maze. To get a different puzzle, click “Generate New Maze.”

SVG downloads use vector graphics, so maze walls stay sharp when enlarged or printed. Hide the shortest path before downloading a blank worksheet, then show it to create an answer key. The distance heatmap is useful for on-screen analysis, but it is usually best disabled for printouts so the colors do not distract from the passages. The filename includes the current seed, which you can enter again later to reproduce the same puzzle.

Common Points of Confusion

• After changing the width, height, or algorithm, click “Generate New Maze” to apply the new settings.
• The random seed affects both the walls and, in Longest Path mode, the selected endpoints. Every setting must match to reproduce a maze exactly.
• The minimum move count measures moves from one cell to an adjacent cell, not the total number of cells visited.
• Restarting a game resets only the player position, move count, and timer. It does not create a new random seed.
• Larger mazes usually require more moves, but they are not necessarily harder to visually solve every time.

Frequently Asked Questions

Can the generator create an unsolvable maze?

No. All three algorithms connect every cell and preserve a valid route from start to finish.

Why do I get a different maze with the same seed?

Check the width, height, generation algorithm, and exit layout as well. The walls and endpoints are reproduced exactly only when every setting and the seed are identical.

Can I generate circular or hexagonal mazes?

The current version focuses on rectangular grid mazes, with walls and movement limited to the four cardinal directions.

How do I make a printable maze with an answer key?

First, hide the path and download the SVG as the worksheet. Then enable “Show Shortest Path” and download a second copy as the answer key.

Why is the maximum size limited to 50×50?

This limit balances browser rendering, mobile controls, and readable exports. On small screens, the individual cell walls of larger mazes become difficult to distinguish.

Methodology and Reference

The generation logic uses the graph-theory concept of spanning trees, implemented through depth-first-search backtracking, Randomized Prim, and Randomized Kruskal. Shortest-path and distance data are calculated with breadth-first search across the maze passages. The interactive design was inspired by the Selfboot maze page and reimplemented with ToolKK sharing parameters, usage statistics, responsive layouts, and SVG export. Return to the settings above to choose a size and seed, then generate your first reproducible maze.