Maze generator

Make a maze with exactly one route through it. Choose a shape, an algorithm and a difficulty, then print it with its solution on a separate page.

Start at the solid dot and find your way to the ring.

Generating maze…

MazeShapeAlgorithm

Long, winding corridors with few branches.

DifficultyWall weight

Columns and rows

Seed

This browser remembers your seed. Share links keep your settings but not the seed, so to draw the same maze elsewhere, type in the seed.

Colors

BackgroundWallsStart, exit and solution

More palettes

Posters and large filesPoster size

Generating maze…

One sheet with the maze and one with its solution, for a large-format printer or print shop. Print at 100%.

PNG size, longest side

The PNG button above uses this size. The largest sizes need a desktop browser and plenty of memory.

Sources

R. C. Prim, Shortest Connection Networks and Some Generalizations, Bell System Technical Journal 36, 1957. Prim's algorithm in the maze maker is named for this paper.
Joseph B. Kruskal, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society 7, 1956. Kruskal's algorithm in the maze maker is named for this paper.
David Bruce Wilson, Generating Random Spanning Trees More Quickly than the Cover Time, Proceedings of the 28th ACM Symposium on Theory of Computing, 1996. Wilson's algorithm in the maze maker is named for this paper.