ACtE09 · Chapter 9AI & Neural Networks🏛️ Past Licensure QuestionID: 7eadda7f
The admissibility of A* search implies that:
The admissibility of A* search implies that:
Multiple Choice Options
- A✓ Correct Option
If A* overestimates the heuristic function, it may not give the optimal path
- B
If A* overestimates the heuristic function, it will give the optimal path
- C
If A* underestimates the heuristic function, it will not give the optimal path
- D
Underestimating prevents finding any path
Detailed Technical Solution & Explanation
By definition, an admissible heuristic never overestimates the true remaining cost to the goal (). If uses an inadmissible heuristic that overestimates costs, it may prune optimal branches prematurely and fail to return the optimal (best possible) path.
Option Analysis:
•
Option A (If A* overestimates the heuristic function, it may not give the optimal path): Correct. Overestimation breaks the admissibility theorem and can cause suboptimal solutions.
•
Option B (If A* overestimates... will give optimal): Contradicts search theory.
•
Option C (If A* underestimates... will not give optimal): Underestimating preserves admissibility (), ensuring optimality.
•
Option D (Underestimating prevents finding any path): Underestimating still finds solutions (e.g., is Dijkstra's).
Reference: Demo2 · Set 2NEC Licensure Syllabus