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
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
