A* — uses cost-so-far plus a Manhattan heuristic. Optimal and efficient: heads toward the goal while guaranteeing the shortest path.
Start Target Wall Explored Shortest pathDrag on the grid to draw walls · drag the start/target to move them
0Cells explored
0Path length
✦ Built by PrimeCore — real algorithms, running live in your browser