A* Facts

Restrictions:

• estimate must be optimisitic (admissible)
• ``locally finite'' graph
• action costs at least $\delta\gt$.

Results:

• path found is optimal
• a path will be found if one exists
• expands the fewest possible nodes (given the heuristic)