Vidyalelo
Computer Science · Q513

Artificial Intelligence

Engineering and GATE · Computer Science · question 513

Q513

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

A.
True
B.
False
Answer

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board