> I was also hoping to use my DAG as a transposition table, > so I could use the Zobrist hash of the current position > to find where the child node would be if it existed. If > the space was already occupied (by a node at the right > depth), I would have a transposition. > > If each "node" might really require several nodes, this > trick won't work. Oh, well. I guess I was trying to kill > too many birds with the same stone.
I'm solving that by using a separate hash table that points to the base node for each position. But it seems like you should be able to use the DAG directly as a transposition table too, with the twin nodes implemented as an overflow list. Anders Kierulf www.smartgo.com _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
