Loading…
Loading…
Loading…
Visualize
Pathfinding, game trees, and N-Queens, one step at a time. Press Watch it run. You do not need the theory first.
Start here
10 algorithms in the catalog.
S is the start, G is the goal. Watch the search fill the grid.
It spreads out evenly from Start until it touches Goal.
OpenIt dives down one path first, then backs up when it hits a dead end.
OpenIt always continues from the cheapest path it has found so far.
OpenIt always moves toward Goal and ignores how long the walk already is.
OpenIt prefers cells that look both cheap so far and close to Goal.
OpenSame algorithms on a parent-child tree with edge costs and h(n).
It spreads out evenly from Start until it touches Goal.
OpenIt dives down one path first, then backs up when it hits a dead end.
OpenIt always continues from the cheapest path it has found so far.
OpenIt always moves toward Goal and ignores how long the walk already is.
OpenIt prefers cells that look both cheap so far and close to Goal.
OpenA moving dot tries to reach the highest point on a bumpy line.
Squares want a high score. Circles want a low one.
Place queens so none share a row, column, or diagonal.