Author: Rafael Andrist
Date: 02:47:55 12/30/01
Go up one level in this thread
On December 28, 2001 at 12:30:32, Miguel A. Ballicora wrote: >Rafael's idea of an incomplete flag is interesting. I have a similar design for >a flag for other purposes (three repetition flag, so I do not store this >position in the hash table). If the score is influenced by a 3 rep in the tree >this position is not stored in the hashtable. It does not solve all the problems >but I think that it solve some. I never heard of this, but I am sure somebody >tried something similar. The general dea of a flag that returns information >about tricky things done in the tree deserves to be explore. >Rafael's case is interesting because it will return: "the score of the qsearch >is x.xx, but, hey! this value depends on a branch I cut off!" >If you think it is not practical, it will be of extreme help to debug your >implementation. How many times this this flag will be set on at the root of >your qsearch? 1:1000000000? then you can remove the flag altogether in the >release version and keep on the debug version of your program. >The general idea is interesting, not only for qsearch cases. Since I have >the design already, maybe I will try it. > >Regards, >Miguel Let me know if you tried it out. I would be interested in the results. regards Rafael B. Andrist
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.