EXPERIMENT VIEWREAL-TIME MODEL · 2D
Algorithms · INTERACTIVE EXPERIMENT
A* Pathfinding Lab: Navigate a Dynamic Maze
Watch the A* search algorithm explore a grid, compare routes and reconstruct the shortest path.
Live simulation
The science behind it
A* ranks frontier nodes using f(n) = g(n) + h(n). With an admissible heuristic on a four-neighbour grid, it finds a shortest path when one exists.
Core relationship
f(n) = g(n) + h(n)