Question

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

(a) True

(b) False

I got this question during an interview.

I'm obligated to ask this question of Uninformed Search and Exploration in section Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

The correct choice is (b) False

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