[Computer-go] effectiveness of transposition tables for go
tesujisoftware at gmail.com
Sun May 9 11:08:00 PDT 2010
On May 9, 2010, at 3:22 AM, Greg Schmidt wrote:
> When assigning the credit value for a node which is a transposition, are *all* parents which point to that node credited, or just the particular one which led to that transposition in the current continuation? If the former case, that's seems like the TT would lead to more efficient learning (a bit "RAVE like" since a single trial results in multiple updates) although wouldn't it be unwieldy for a node to have a list of pointers back to its multiple parents?
Obviously there's some overhead. My hash-table doesn't store positions, but lists of tree-nodes that have the same hash-code. So you don't need to keep lists of parents explicitly, it follows from being in the same list.
More information about the Computer-go