•A search strategy is defined by picking the order of node expansion
•Strategies are evaluated along the following dimensions:
–completeness: does it always find a solution if one exists?
–time complexity: number of nodes generated
–space complexity: maximum number of nodes in memory
–optimality: does it always find a least-cost solution?
No comments:
Post a Comment