On Tue, 2007-01-30 at 14:31 -0500, Don Dailey wrote: > A truly selective program cannot be scalable unless it is selective > in an admissible way. I think SlugGo is a true selective search > program right?
You can determine if you program is truly scalable with a thought experiment: Would this program play perfect chess given enough time? Botnoid is not scalable, but it does improve rapidly up to a point of severely diminishing returns. But even if there were such a think as an "googleplex" computer, Botnoid would not play any better than it does as AnchorMan on CGOS. - Don _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
