Vidyalelo
Computer Science · Q632

Artificial Intelligence

Engineering and GATE · Computer Science · question 632

Q632

When is breadth-first search is optimal?

A.
When there is less number of nodes
B.
When all step costs are equal
Answer
C.
When all step costs are unequal
D.
None of the mentioned

Answer: Option B

Solution

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