A* Search Algorithm
A* Search balances backward path cost g(n) with forward estimated heuristic cost h(n) using f(n) = g(n) + h(n). Admissible heuristics guarantee optimality.
Category:Informed Search
•Difficulty:Intermediate
•Time complexity:O(E log V)
•Space complexity:O(V)
Interactive visualizationA* Visualizer
Edit mode: Click/drag to draw walls, drag Start (S) or Goal (G)
Start / Goal Wall Visited Frontier Path
S
G
0 / 0
Speed:
Nodes Explored0
Frontier Size0
Path Cost g(n)—
Total Steps0
No step trace active. Click "Visualize A*" to begin algorithm execution.