On Aug 10, 2008, at 1:46 PM, Robert Waite wrote:
Exhaustive search is scalable in that I could give it all the
memory and time it wanted. And it would approach a finite amount of
memory and a finite amount of time.
Yes, but "exhausitve search" does not improve your player by 63% (eg.)
for a doubling in CPU time.
This part was done in an empirical scalability study. Please check the
archives of the list.
In the (inifinite) limit minimax+evaluation-function would find the
perfect move
too, but UCT/MC already find "good" moves before the limit.
Christoph
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
