Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Which is NOT true about the uniform cost search?
It is not complete.
It always expands the lowest-code node.
A variant of the uniform-cost search is Dijkstra's algorithm (the basic algorithm is essentially the same).
It is optimal if nodes expand in increasing order of g(n).
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!