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/
