AI MCQ #210: Breadth-first search is not optimal when all step costs are equal, because it al…

by

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

  • a) True
  • b) False

✅ Correct Answer: B) False

Explanation: Breadth-first search is optimal when all step costs are equal, because it always expands the shallowest unexpanded node. If the solution exists in shallowest node no irrelevant nodes are expanded.