[Computer-go] effectiveness of transposition tables for go

Mark Boon tesujisoftware at gmail.com
Tue May 11 07:34:15 PDT 2010

On May 10, 2010, at 11:09 PM, Petr Baudis wrote:

>> OK. Then I'm curious, was the solution something along the lines what
>> Don described?
> I admit I got a bit lost in who described what. ;-)

Whether you store some information about each successor in the node or if you compute the hash-key for each child while you get its win-rate.


More information about the Computer-go mailing list