AI MCQ #197: When is breadth-first search is optimal?

by

Q197. 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

✅ Correct Answer: B) When all step costs are equal

Explanation: Because it always expands the shallowest unexpanded node.