Q577
Which search is complete and optimal when h(n) is consistent?
A.
Best-first search
B.
Depth-first search
C.
Both Best-first & Depth-first search
D.
A* search
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board