Pathweaver
Pathfinding algorithms, made watchable. Paint walls and rough terrain on a grid, place a start and a goal, choose an algorithm and press play: it explores the maze cell by cell, colouring what it visits and tracking its frontier, then lights up the route once it reaches the goal.
Because all four algorithms run on the same layout, the differences stop being abstract. Breadth-first fans out evenly while depth-first plunges down one branch; Dijkstra weighs terrain cost to find the genuinely cheapest route; A* uses a distance estimate and visibly explores less of the maze to reach the same goal.
- A library of built-in mazes — open field, costly shortcut, dead ends, bottleneck — each chosen to expose a particular quirk.
- A compare screen laying the four algorithms side by side with their guarantees and complexity.
- Step one move at a time to study the frontier, or run at full speed and edit the grid to see how the search reacts.
- Saved mazes, runs by algorithm and a practice streak, plus your own accent colour for the found path.
- Runs entirely on the device. No account, no connection, no advertising, no analytics.
Try the searchthe same four algorithms — paint on the grid and run one
explored —
path length —
path cost —
start
goal
visited
frontier
rough terrain