← Back to Index

⭐ A* Pathfinding

Graph · Heuristic search
Path Length
0
Open Set
0
Closed Set
Ready
Status
30 ms
Click cells to toggle walls. Use the sidebar to switch between wall/start/end modes, then hit Run.
Unvisited
Open set
Closed set
Final path
Start
End
Wall

What you're seeing

A* is an informed search algorithm that uses a heuristic (Manhattan distance) to guide the search towards the goal. It combines the actual cost from the start (g) with an estimated cost to the goal (h) to pick the most promising node.