How a Maze Generator Builds Solvable Printable Puzzles Every Time

A maze that can't be solved is just a wall of ink. The whole point of a maze generator is the quiet guarantee underneath every random layout: the entrance always reaches the exit, and there is exactly one way through. That guarantee isn't luck. It comes from treating the grid as a graph and carving it with an algorithm that physically cannot leave a cell stranded.

This post walks through how that works, why the two most common carving methods feel so different to solve, and how to get clean printable mazes for a classroom, an activity book or a game night. Try it as you read with the Maze Generator.

A maze is a grid of cells with walls between them

Start with the model. Picture an N by M grid where each square is a cell, and every pair of neighbouring cells has a wall between them. At the start, all walls are up, so every cell is its own little box. "Generating a maze" means knocking down a carefully chosen subset of those walls so the boxes connect into corridors.

The number of walls you remove is not arbitrary. To connect all N times M cells into one network with no redundant connections, you remove exactly N times M minus 1 walls. A 10 by 10 grid has 100 cells, so a finished maze opens exactly 99 passages. That single number is the fingerprint of a perfect maze: connected, with no loops and no walled-off rooms.

Recursive backtracking carves a spanning tree

The default carving method in most tools, including this one, is recursive backtracking, also called randomized depth-first search. Here is the loop in plain terms:

Start at a cell, mark it visited, and pick a random unvisited neighbour.
Knock down the wall between them, move into that neighbour, and repeat.
When you hit a cell with no unvisited neighbours, a dead end, walk back along your path until you find a cell that still has an unexplored direction, then branch off again.
Stop when every cell has been visited.

The concrete point worth holding onto: recursive backtracking carves a spanning tree over the grid, so every cell connects to every other cell through exactly one unique path. A spanning tree is a connected graph with no cycles, which is the mathematical definition of a perfect maze. Because there are no cycles, there are no choices that loop back on themselves, so the route from any cell to any other is forced and singular. That is why a solver can never get genuinely lost in a generated maze, and why the answer line is never ambiguous.

The personality of this method is long, winding corridors. Depth-first search commits to a direction and follows it until it dies, so you get sweeping passages with relatively few short shortcuts. To a human, that reads as "hard and satisfying," because the obvious-looking path usually turns out to be a long detour.

Prim's algorithm grows the maze outward instead

The other classic carver is randomized Prim's algorithm, and it builds the same perfect maze from a completely different temperament. Instead of tunnelling deep and backtracking, Prim's grows the maze like spreading frost:

Start with one cell in the maze and add all its walls to a frontier list.
Pick a random wall from the list. If the cell on the far side isn't in the maze yet, knock the wall down and pull that cell in, adding its new walls to the frontier.
Repeat until the frontier is empty.

Both algorithms produce a spanning tree, so both give you that single-unique-path guarantee and the same N times M minus 1 wall count. The difference is texture. Prim's expands evenly in all directions, which scatters many short dead ends and produces a bushy, branchy maze with lots of little decisions near the true path. Recursive backtracking, by contrast, produces fewer but longer dead ends. For worksheets aimed at young kids, the branchier Prim's-style feel can be gentler; for older solvers who want a real fight, the long corridors of backtracking tend to land harder. The key takeaway is that "harder" and "easier" here are about the shape of the tree, not about whether the maze is solvable, because both are always solvable.

Showing the one correct solution

Once a perfect maze exists, finding its solution is easy precisely because the path is unique. The tool runs a breadth-first search from the green entrance at the top left to the red exit at the bottom right and draws the route it finds as a single coloured line. In a maze with loops you'd have to reason about which of several routes is shortest, but in a spanning tree there is only one route between two points, so breadth-first search returns the answer, not an answer.

That is what makes the Show solution toggle trustworthy for an answer key. You print the puzzle with the line off, then print one reference copy with it on, and you know the line is the genuine and only route, not one of several near-misses a grader has to double-check.

Printing sharp mazes for classrooms, kids and games

The reason vector output matters becomes obvious the moment you print. Here is a concrete setup I reach for: a 15 by 15 grid for a class of thirty kids. That size gives 225 cells and 224 open passages, hard enough to keep a fast finisher busy but quick enough that a six-year-old won't quit. I keep the walls black, set thickness to at least 2px so thin lines don't break up on paper, turn the solution off, and download the SVG. Because it's vector, it fills an A4 or Letter page without a hint of blur, and I can print thirty crisp copies from one file.

A few habits that save reprints:

Bump wall thickness to 2px or more for anything headed to a printer. A 0.5px wall that looks fine on screen can vanish on paper at small cell sizes.
Generate a fresh maze between prints for a game or escape room so no two players get the same layout. Each one is carved with browser crypto randomness, so they genuinely differ.
Keep the solution copy separate and label it clearly, or you'll hand a class the answer sheet by mistake.

When I'm assembling a printable pack, I'll drop a 12 by 12 maze on the easy page and a 25 by 25 on the challenge page, then build the rest of the booklet around it. A maze pairs naturally with other print-and-go puzzles, so I'll often add a board from the Sudoku Generator on the facing page for variety.

The short version

A maze generator earns its keep by guaranteeing solvability, and it does that by modelling the grid as a graph and carving a spanning tree across it. Recursive backtracking gives you long, snaking corridors; Prim's gives you a bushier, branchier feel; both produce a perfect maze with exactly one path between any two cells. Pick the size for your audience, keep the walls thick for print, and let the breadth-first solver draw the one true answer when you need a key.

Made by Toolora · Updated 2026-06-13