On Thu, 2008-09-04 at 18:07 +0200, Rémi Coulom wrote: > When the playouts evaluate a critical semeai the wrong way, then no > supercomputer can help, even at long time control. Semeais require a > better algorithm, because no computing power can search them out with > a > tree, and playouts have to be extremely intelligent in order to > evaluate > them correctly. > > Rémi
Rémi, I have no doubt that is true and that ways should be found to deal with this. It will probably happen like in chess where at some point players learn how to play against machines and this will suppress the ratings for a while. I fully expect that to happen. This happened around the time that chess playing computers suddenly became a commodity item in the late 70's early 80's approximately. It was almost as if computers stopped improving for 2 or 3 years even though they really were getting better. I don't think this will have any affect on their scalability - it is just a reflection on how difficult go is to play for computers. There were also seemingly insurmountable problems in chess just like this where people said no amount of search will fix it but it didn't stop the very slow but gradual improvement. To this very day it's possible to find chess positions that computers play stupidly, but it's getting really rare. - Don _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
