Evaluating Search Strategies

• Completeness
  Guarantees finding a solution whenever one exists

• Time Complexity
  How long (worst or average case) does it take to find a solution? Usually measured in terms of the number of nodes expanded

• Space Complexity
  How much space is used by the algorithm? Usually measured in terms of the maximum size that the "nodes" list becomes during the search

• Optimality/Admissibility
  If a solution is found, is it guaranteed to be an optimal one? That is, is it the one with minimum cost?