On May 9, 2010, at 8:55 AM, Greg Schmidt wrote: > Yes, that' how it's typically done, but I don't see how that leads to finding > *all* parents of a given node. The situation I'm referring to is when you're > propagating the UCT value back up the tree following a simulation. If you > also want to update *all* parents of that node (not just the single parent > within the simulated line of play), how would you find *all* of them? The > parent nodes will have different hash codes (and be in different chained > lists) in your representation. Therefore I don't see how this representation > is able answer the question "give me the list of all parent nodes which point > to this TT entry" (unless I'm missing something).
I think you're missing something. If I reach a node, I look up what other nodes have the same transposition value. Each of those nodes knows its single parent. Nodes do not have multiple parents stored explicitly. Mark _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
