Endless Patterns

Maze generator: Hidden message

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.

Hidden message

Enter at the top left and find your way out at the bottom right. The only route through spells the message.

Generating maze…

Maze

Up to 40 characters: 6 words of up to 12 letters. Letters, numbers, accents and . , ! ? ' - & + ♥ all work, in capitals.

To draw the maze, your message is sent to our server as part of the request's address, and it can appear in server logs. We don't put it on shared caches. It stays out of this page's address and share links, so a link won't give it away, or carry it. To share your maze, download it.

Long, winding corridors with few branches.

The longer your message, the bigger the maze. A higher difficulty makes the letters wider and harder to spot.

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
More palettes
Posters and large files

Generating maze…

One sheet with the maze and one with its solution. Sizes above Legal need a large-format printer or print shop. Print at 100%.

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.
Acknowledgements