Algorithms

Text maze constructor

Hide a word inside a maze and watch independent searches reveal it. Choose one algorithm or mix their colours on the same field.

How hidden lettering and the four searches work →

How it works

  1. Enter the inscription, choose its font and video format, then build a maze. New seeds produce new passages; changing the inscription only changes the reveal mask.
  2. Play or scrub the preview. Each search follows its own rules. Shared visited cells mix colours. Independent BFS cells at the same distance and ready A* cells with the same f animate together.
  3. Optionally choose a music file and adjust its volume, then save a video. Recording takes the selected duration. You can cancel it; the preview and settings remain available.

The maze also exists outside the letters. Visits there are muted, so the inscription is hidden initially. The exit is one of the farthest cells from the start: BFS reaches every cell before it finishes. Without BFS, some parts of the text may remain dark. No extra fill is added after search.

Every passage costs one step. A* uses Manhattan distance; g is the distance already travelled and h is the estimated distance remaining. BFS and A* find shortest paths here. DFS and Greedy do not guarantee the shortest path. Font rendering during construction can vary between devices; a shared link preserves the already built lettering shape.