Examveda
Examveda

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.

A. True

B. False

Answer: Option B


This Question Belongs to Computer Science >> Artificial Intelligence

Join The Discussion

Related Questions on Artificial Intelligence