Author: Hristo
Date: 08:57:01 04/07/99
Go up one level in this thread
I can give you my code for the quad-linked list. It is done with templates so you can put your structure without any problem. The linked list nodes are kept in a diferent memory block from the actual data for the nodes. That gives you one huge linear buffer very similar to a hash table where your structures would be stored. In my case it takes 40 bytes total(including the links)to store a move. So 40MBytes = 1M moves in the tree. I was thinking of doing the combo(hash+linked list), but I would like to have one of them working first. Hristo
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.