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
This question was posed to me during an interview.
Question is taken from Uninformed Search Strategy in portion Problem Solving of Artificial Intelligence