On 27-okt-08, at 11:51, terry mcintyre wrote:
----- Original Message ----
From: Mark Boon <[EMAIL PROTECTED]>
<snippage>
Let me first describe what I did (ar attempted to do): all nodes are
stored in a hash-table using a checksum. Whenever I create a new node
in the tree I add it in the hash-table as well. If two nodes have the
same checksum, they are stored at the same slot in the hashtable in a
small list.
When I add a node to a slot that already contains something, then I
use the playout statistics of the node(s) already there and propagate
that up the tree.
Am I reading this right? Are all nodes in the same slot considered
equivalent? Could some of these nodes be collisions?
Yes, all the nodes in the same slot are considered equivalent.
They're not collisions. If a node hashes to a slot with a different
checksum, it keeps looking for an empty slot. If it doesn't find an
empty slot it throws out some nodes to which it collided.
Mark
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
