[computer-go] Monte Carlo and transposition tables
Chrilly
c.donninger at wavenet.at
Wed Jul 26 10:24:16 PDT 2006
There are some complications involving the graph history interaction problem and backing up values from nodes with multiple parents, but we think we have a way to do it...
GHI:
I do not know the effects of GHI in Monte-Carlo engines or non-Alpha-Beta algorithms. But for conventional chess-engines its an artificial problem. Sometimes the mate distance is one move off but I have never encountered in the last 15 years a game were my programm did not mate correctly due to this problem. Including Engine-Engine matches were I was directly watching (and therefor checking) this are several thousand games. The easiest and most efficient solution of GHI is to ignore it.
Chrilly
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20060726/90392474/attachment.htm
More information about the computer-go
mailing list