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