Examveda
Examveda

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: Option D


This Question Belongs to Computer Science >> Artificial Intelligence

Join The Discussion

Related Questions on Artificial Intelligence