# Tag Info

Accepted

Accepted

### A* and uniform-cost search are apparently incomplete

You forgot to calculate and take into account the costs of the actual paths. You forgot to accumulate the cost of the edges for going forward and backward multiple times! The evaluation function of ...
• 34.4k
Accepted

### If uniform cost search is used for bidirectional search, is it guaranteed the solution is optimal?

UCS is optimal (but not necessarily complete) Let's first recall that the uniform-cost search (UCS) is optimal (i.e. if it finds a solution, which is not guaranteed unless the costs on the edges are ...
• 34.4k
Accepted

### Understanding the pseudocode of uniform-cost search from the book "Artificial Intelligence: A Modern Approach"

I think this is a problem with missing brackets in pseudocode — clearly the state is only added to the frontier if it hasn't been explored already, so it would be: ...
• 5,062
1 vote
Accepted

### What is the difference between the uniform-cost search and Dijkstra's algorithm?

The answer to my question can be found in the paper Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm (2011), in particular section Similarities of ...
• 34.4k
1 vote

### If uniform cost search is used for bidirectional search, is it guaranteed the solution is optimal?

It depends on the stopping condition. If the stopping condition is "stop as soon as any vertex is encountered by both the forward and backward scan", then bidirectional uniform-cost search ...
• 111

Only top scored, non community-wiki answers of a minimum length are eligible