Which of the following search algorithm is optimal and complete when h(n) is consistent?
A). Best-first search
B). Depth-first search
C). Both A and B
D). A* search
Answer:D
Which of the following search algorithm is optimal and complete when h(n) is consistent?
A). Best-first search B). Depth-first search C). Both A and B D). A* search