Start
End
Wall
Visited
→ Path
Status
●
Idle
Results
Nodes
—
Path Len
—
Time ms
—
Optimal
—
Result
—
Algorithm Info
A* Search
Combines path cost g(n) with Manhattan heuristic h(n). Most efficient optimal algorithm on grids.
Activity Log