 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
• |
Evaluate
states passing cutoff-test according to
|
|
|
heuristic
evaluation function
|
|
|
• |
Consider
Chess
|
|
|
|
– |
enormous
state space
|
|
|
|
– |
can't
possibly search whole tree with current
|
|
|
|
computational
limitations
|
|
|
• |
Must
|
|
|
|
– |
limit
depth of search
|
|
|
|
– |
evaluate
non-terminal nodes at limit
|
|