Quoting Peter Drake <[EMAIL PROTECTED]>:
Only 28 bytes? What's in your nodes? That doesn't seem like enough room for 82 pointers to children. If you don't have pointers to children, how do you find the children's statistics for UCT? Play each move and examine the resulting hash code?
The tree pointers are in the nodes. There is child and sibling pointer. The child pointer points to the first child and and the sibling pointer of the child points to all sibling of that child. The drawback is that you need to traverse the linked list so reach lets say child 32. The advantage is that there are not more pointer than nodes. So only 8 bytes is necessary to connect all node in a tree structure. If one whish one could also add a parent pointer but I sofar never needed that. -Magnus _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
