Author: Andrei Fortuna
Date: 04:30:47 06/16/03
Go up one level in this thread
On June 16, 2003 at 07:08:44, Uri Blass wrote:
>
>In my program I calculate the evaluation at every node and in the leaves I may
>calculate only part of the evaluation.
Wow! Isn't this slower than the usual method of evaluation only in leaves ?
What are the advantages if I may ask ? Better move ordering ? Just curious ...
>>It just occured to me that I can eliminate transmitting the parent_id parameter
>>! The code will look like this :
>>
>> Search(...){
>>
>> int node_id = CHANT_MarkNode(...)
>>
>> ....
>>
>> ... before _every_ return point add this code ....
>> CHANT_WriteNode(node_id, ..., extra node info);
>> }
>>
>>i.e. it will write all informations without parent_id, then when we are all done
>>I will write code that automagically walks the tree generated until now and
>>fills in parent_id for nodes. A bit more CPU load but when you dump the tree you
>>are using the harddisk so speed is not essential. And this way you will have
>>much simpler code !
>>
>>What do you think, is this solution satisfactory ?
>
>I think that it may be a good idea.
>I prefer this idea and not adding another parameter to the functions.
Allrighty ! I have alrady started the changes. The file format will be the same,
only the library interface will be a bit simplified.
Cheers,
Andrei
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.