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
Answer:D
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
Explanation: None.