Orego has a transposition table. Following the advice of David Fotland
(and working under the apparently mistaken impression that everyone
else had one), I made each node contain the win rate information on
its children. The primary benefit of this is that comparing the
children of a node (when choosing a move to play within the "tree")
has very good cache behavior. Also, nodes don't have to know about
their parents.
As for graph history interaction, Orego includes the simple ko point
as part of the hash code. Conflating otherwise-identical nodes reached
by different paths could conceivably cause the program some moves that
are illegal, but I believe (without strong evidence) that such events
are rare enough to ignore.
Peter Drake
http://www.lclark.edu/~drake/
On May 9, 2010, at 11:22 AM, Mark Boon wrote:
So nobody has made it work yet? That makes me feel a little better,
I thought I was the only dummy who hadn't managed :)
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
