Author: Miguel A. Ballicora
Date: 14:50:09 02/26/01
Go up one level in this thread
On February 26, 2001 at 16:47:28, Christophe Theron wrote: [deleted a lot] >>It is possible that the same program is going to be the best at long time >>control and not the best at short time control because it use ideas to make it >>better at long time control. > > >That's something some people want you to believe. > >As for myself, and I think I have tried A LOT, I have never seen any idea that >makes a program better at long time controls if it does not make it better at >short time controls. First of all, let me say that this is an interesting discussion. I am an amateur at C.C., Still, I am not sure about the above statement. For instance, a better replacement scheme on the hashtables will have a great impact at deeper searches. In shorter ones, it won't have any effect. In general, I think that any idea that reduces the tree decreasing the branching factor will have an impact in longer time searches, despite that implementing the idea will consume cpu time (hurting short time searches). Could not be SEE ordering and example? Wouldn't preprocessed information help a lot in short searches but get in the way in long searches? Regards, Miguel
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.