AI & MLRecommendedAIML-AIF-004
Heuristic Search and A*
Guiding search with an estimate of remaining cost; admissible heuristics keep A* optimal.
- Difficulty
- 3 / 5
- Importance
- 4 / 5
- Study time
- 1–2 h
- Kind of work
- Mixed
Why it matters
The learner can compare expansions of uniform-cost and A* under two heuristics and explain why an inadmissible heuristic can return a suboptimal path.