14 Jan 2004
CS 3243 - Blind Search
24
Search strategies
nA search strategy is defined by picking the order of node expansion
nStrategies are evaluated along the following
dimensions:
ncompleteness: does it always find a solution if one exists?
ntime complexity: number of nodes generated
nspace complexity: maximum number of nodes in memory
noptimality: does it always find a least-cost solution?
nTime and space complexity are measured in terms of
nb: maximum
branching factor of the search tree
nd: depth of
the least-cost solution
nm: maximum
depth of the state space (may be ∞)