On Mar 10, 2008, at 8:07 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
Some programs hash each position and the tree is more abstract, no
pointers just positions leading to other positions by zobrist hash
keys in a hash table.
My scheme probably wastes a lot of space on nodes that are left
unvisited at the leaves of the tree. But I don't waste much on
storing pointers since I keep them in an array.
What is the state of the art on this? How is everyone else doing it?
Before creating a child, I calculate hash keys like I would for
situational super ko. If there's a hit in the transposition table, I
reuse the pointer. If not, I create and add. It's simple to implement
and should significantly reduce searches.
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
