3 Feb 2005
CS 3243 - Game playing
19
Resource limits
nThe big problem is that the search space in typical games is very large.
nSuppose we have 100 secs, explore 104 nodes/sec
à 106 nodes per move
n
nStandard approach:
ncutoff test:
ne.g., depth limit (perhaps add quiescence search)
nevaluation function
n= estimated desirability of position