Q.

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» D. a* search
1.3k
0
Do you find this helpful?
6

Discussion

No comments yet