A* algorithm is guaranteed to find an optimal solution if
2012
A* algorithm is guaranteed to find an optimal solution if
- A.
h' is always 0.
- B.
g is always 1.
- C.
h' never overestimates h.
- D.
h' never underestimates h.
Attempted by 104 students.
Show answer & explanation
Correct answer: C
A* uses
f(n)=g(n)+h′(n)
For optimal solution, heuristic must be admissible :
h′(n)≤actual cost h(n)
i.e., heuristic never overestimates the real cost.
Correct Answer: C. h′ never overestimates h
A video solution is available for this question — log in and enroll to watch it.
Loading lesson…