Which search technique is complete and optimal, when h(n) is consistent?
PYQ UGC NET 2022
Which search technique is complete and optimal, when h(n) is consistent?
- A.
Best First Search
- B.
Depth First Search
- C.
A* Search
- D.
Breadth First Search
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…

