On May 9, 2010, at 6:22 PM, Don Dailey wrote: > So you are basically using the tree based data structure which is wasteful of > space and supplementing it with a hash table to give you transposition > information. You are trying to get the best of both worlds by accepting the > downside of both methods too.
I never claimed it was the most memory efficient. It's a little more expensive than just trees. But I never experienced the memory-problems to the extent others have mentioned in the first place. I started out with a tree because it's a little easier to debug. Then I tried transpositions to see if in principle it would work. I could have spent a lot of time trying to reduce the memory-footprint first. But then failing to make it work would have made me unhappier still. Mark _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
