Questions tagged [completeness]

For questions about the completeness of search algorithms. A search algorithm is complete if it is guaranteed to find one solution (if there is one).

Filter by
Sorted by
Tagged with
2
votes
1answer
85 views

Why is the completeness of UCS guaranteed only if the cost of every step exceeds some small positive constant?

I was reading Artificial Intelligence: A Modern Approach 3rd Edition, and I have reached to the UCS algorithm. I was reading the proof that UCS is complete. The book state that: Completeness is ...