A* Search

• Idea

  • Best first search with admissible heuristic
  • Plus keep checking until all possibilities look worse

• Evaluation

  • Finds optimal solution?
  • Time Complexity?
  • Space Complexity?

Yes

O(b^d)

O(b^d)

Underestimates cost of

any solution which can

reached from node

Previous slide

Next slide

Back to first slide

View graphic version