MMySimulatorInteractive 2D labs ← All simulations
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
EXPERIMENT VIEWREAL-TIME MODEL · 2D

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 relationshipf(n) = g(n) + h(n)
Made with 🤖 ChatGPT