The Provably Shortest Path

Mode

Pathfinding

Percolation

Algorithm

A*admissible h · optimal & focused

Dijkstrah = 0 · optimal, floods all

Greedy (h×2.5)inadmissible · can overshoot

Race ⇄A* vs Dijkstra, same goal

Grid size

Wall density

Terrain weight

Animation speed

shade terrain cost

Built in the Workshop. The path that looks short isn't a proof — so we prove it: A* (admissible), Dijkstra, and an independent Bellman-Ford oracle must agree on the minimum cost, every time, or the self-test goes red.
← back to the Workbench