Upload or photograph a black and white maze, click the start and end points on the image, and get the solution in milliseconds.
Behind the scenes
- Converts the maze image into a binary grid (white = open, black = wall)
- Runs Breadth-First Search (BFS) to find the shortest path
- Draws the resulting route directly on
<canvas>
From demo to real work
This toy demo uses BFS to explore a grid - the same principle behind routing delivery trucks, optimizing task scheduling in compute pipelines, and building recommendation graph traversals at scale.
Curious how this toy demo connects to real-world problems?
Drop a note at maze@ouatu.ro
This is an open-source project. Feel free to explore the source code
on
GitHub
.