AI Models & Assistants / Knowledge library
A* Search
Ranks paths by known cost plus an estimate of remaining cost
Why learn A* Search?
It can find optimal paths while exploring far fewer states than uninformed shortest-path search.
The problem it solves
It focuses expensive route search toward a goal by using domain knowledge as a heuristic.
Where it came from
A* expands the frontier state with the smallest f(n)=g(n)+h(n). An admissible heuristic does not overestimate remaining cost; consistency additionally keeps estimated costs monotone along edges.
Build your understanding
Work through these exercises in order. Try the task before opening a reference.
- Define A* Search and distinguish it from a nearby concept.
- Choose a realistic task where A* Search is appropriate.
- Identify one failure mode or misuse of A* Search.
- Interpret a small result produced with A* Search.
- Explain one limitation or tradeoff of A* Search.