Author: Don Dailey
Date: 12:11:52 01/04/98
Go up one level in this thread
>The idea of the asymetrical search started like a little alarm in my >head. I'm sure you already had this kind of feeling. A simple idea that >seems good, but... I just have the idea. I don't know how to realize >it... > >And there MUST be something interesting about it. If not, I would like >to prove it quickly, and get rid of it, because this idea is now >consuming a lot of my CPU time! > >Hey, readers, any suggestion? > > > Christophe We could start with some simple experiments. Suppose we (as a test) threw out null move altogether and always took a beta cutoff at ood nodes, after ply 1, 3, 5, 7 etc. This of course would be when when the static eval >= beta. This first experiment would give us an uppper bound on how fast this could be. If it's not fast, we may be barking up the wrong tree! Any one of us could perform this experiment very quickly. We could start with a liberal value of 12 selective so that a 13 ply search becomes 1 full width. The test might be done with and without the restriction of taking cutoffs when in check. It's not clear that Richard avoids cutoffs when in check either, maybe he does a static test of some kind. I think for a while we should assume it's all based on static things and not researching like null move. This may turn out to be wrong but it seems to be the general belief. -- Don
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.