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.
Answer:C
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.