On Wed, Aug 13, 2008 at 1:29 PM, Hideki Kato <[EMAIL PROTECTED]> wrote: > Rémi Coulom: <[EMAIL PROTECTED]>: >>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. > > Abstract in English: > The UCT algorithm is a representative best-first search algorithm that > has been popularly used in Monte Carlo Go. This paper presents the > DFUCT (Depth-First UCT) algorithm, which is an efficient depth-first > variant of UCT. Experimental results in Go show that DFUCT achieves > 3% improvement in running time, while the solving abilities of DFUCT > and UCT are comparable. > > This paper is written in Japanese.
Thank you for the translation. cheers stuart _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
