| Resource
limits |
|
|
|
|
|
|
|
|
|
|
| The big problem
is that the search space in typical |
|||||||||
| games is very
large. |
|||||||||
| Suppose we have
100 secs, explore 104 nodes/sec |
|||||||||
| 106
nodes per move |
|||||||||
| Standard
approach: |
|||||||||
| n | cutoff
test: |
||||||||
| e.g., depth
limit (perhaps add quiescence
search) |
|||||||||
| n | evaluation
function |
||||||||
| = estimated
desirability of position |
|||||||||
