Which search is complete and optimal when h(n) is consistent?
A. Best-first search
B. Depth-first search
C. Both a & b
D. A* search
Answer:A
Which search is complete and optimal when h(n) is consistent?
A. Best-first search B. Depth-first search C. Both a & b D. A* search
Explanation:None