Great news. Well done to the Mogo team. John, if I can just find 3000 CPUs lying around I might actually win our bet ;-).
> I do have to ask -- if 1.7 million playouts per second are required > and an hour of playing time are required to reach this level, ... Can Olivier give us more details. A few questions that come to mind: how many playouts per *move* was it using in each of the opening, middle game and endgame? Was it using a fuseki book, and how many moves did the game stay in that book? And once it was out of the book was it all UCT (*) search, or were there any joseki libraries, etc.? I'd also be interested to hear how inefficient the cluster was (e.g. 1000 CPUs won't be doing 1000 times the number of playouts, there must be some overhead). Darren *: Sorry, I've forgotten the new term we are supposed to use. -- Darren Cook, Software Researcher/Developer http://dcook.org/mlsn/ (English-Japanese-German-Chinese-Arabic open source dictionary/semantic network) http://dcook.org/work/ (About me and my work) http://darrendev.blogspot.com/ (blog on php, flash, i18n, linux, ...) _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
