MYSIMULATOR / 2D Lab

Pathfinding Lab: The A* Search

Watch an informed search explore a maze and reveal a route from start to destination.

LIVE SIMULATION
Interactive experimental environment 2D CANVAS ENGINE
LIVE MODEL ● 0.0 s
Space: toggle · R: reset
✦

Behind the science

A* finds a path by minimizing f(n)=g(n)+h(n), where g is travel cost and h estimates remaining distance. This four-neighbour grid uses Manhattan distance. Increasing the heuristic weight can speed exploration, but values above 1 no longer guarantee the shortest route.