Author: KarinsDad
Date: 09:49:20 04/07/99
Go up one level in this thread
On April 07, 1999 at 11:57:01, Hristo wrote: >I can give you my code for the quad-linked list. Thanks, but it probably would not work anyway. The reason is that just like the parents, I would have to save multiple copies of the "next / prev" based on where in the "tree" (i.e. which parent it corresponds to and which ply) it is. Since I already have the code for the parent, it is a simple matter to modify my structure and re-use the code for "next / prev" if I need it. >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. This is similar to what I am doing. >In my case it takes 40 bytes total(including the links)to store a move. >So 40MBytes = 1M moves in the tree. I used to DREAM of having a structure as small as 40 bytes. :) > >I was thinking of doing the combo(hash+linked list), but I would like to have >one of them working first. Good plan! > >Hristo Thanks anyway, KarinsDad :)
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.