Where are heuristics applied in UCT Go?
The following is a review of the literature regarding application of
heuristics to UCT Go. It explicitly does not address questions of how
the heuristics are generated nor of other algorithmic improvements.
Numbers are section numbers within papers.
I
On 6/7/07, Peter Drake [EMAIL PROTECTED] wrote:
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van denHerik
H.J., and Bouzy B. Progressive strategies for Monte-Carlo tree
search.
1.3.1: Add heuristic value (divided by # of playouts) to UCT value.
While I haven't done any
By all means, try it out and write up a paper!
Peter Drake
http://www.lclark.edu/~drake/
On Jun 7, 2007, at 11:25 AM, Jason House wrote:
On 6/7/07, Peter Drake [EMAIL PROTECTED] wrote:
Chaslot G.M.J.B., Winands M.H.M. Winands, Uiterwijk J.W.H.M., van den
Herik H.J., and Bouzy B.
