Apparently that paper is available in Japanese: Haruhiro Yoshimoto, Akihiro Kishimoto, Tomoyuki Kaneko, and Kazuki Yoshizoe. Depth-First UCT and Its Application to Go (in Japanese) (DFUCT‚̈͌é‚ւ̉ž—p‚ɂ‚¢‚Ä), 12th Game Programming Workshop in Japan, pages 30-35, 2007.
http://www.fun.ac.jp/~kishi/publication.html Terry McIntyre <[EMAIL PROTECTED]> “Wherever is found what is called a paternal government, there is found state education. It has been discovered that the best way to insure implicit obedience is to commence tyranny in the nursery.” Benjamin Disraeli, Speech in the House of Commons [June 15, 1874] ----- Original Message ---- From: Rémi Coulom <[EMAIL PROTECTED]> To: computer-go <computer-go@computer-go.org> Sent: Tuesday, August 12, 2008 10:14:16 AM Subject: [computer-go] Depth-first UCT Gian-Carlo Pascutto wrote: > > The *paper* about MTD(f) is extremely interesting because it shows > that many best-first algorithms can be rewritten as depth-first > algorithms. > > It happened for SSS, it happened for proof-number search. > > Who will make it happen for UCT? > Actually, there was a paper presented at the 2007 Computer-Game Workshop in Japan entitled "Depth-First UCT and its Application to Go", by Haruhiro Yoshimoto, Akihiro Kishimoto, Tomoyuki Kaneko, and Kazuki Yoshizoe. Rémi _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
