When is breadth-first search is optimal?
A. When there is less number of nodes
B. When all step costs are equal
C. When all step costs are unequal
D. None of the mentioned
Answer:B
When is breadth-first search is optimal?
A. When there is less number of nodes B. When all step costs are equal C. When all step costs are unequal D. None of the mentioned
Explanation: Because it always expands the shallowest unexpanded node.