 |
|
|
|
|
|
|
|
|
|
|
|
|
|
| n |
A search
strategy is defined by picking the order of node
|
|
expansion
|
|
|
| n |
Strategies are
evaluated along the following dimensions:
|
|
n |
completeness: does it always find a solution if one
exists?
|
|
|
|
n |
time
complexity: number of nodes
generated
|
|
|
n |
space
complexity: maximum number of
nodes in memory
|
|
|
n |
optimality: does it always find a least-cost solution?
|
|
|
| n |
Time and space
complexity are measured in terms of
|
|
|
|
n |
b:
maximum branching factor of the search tree
|
|
|
n |
d: depth
of the least-cost solution
|
|
|
n |
m:
maximum depth of the state space (may be ∞)
|
|
