Author: Miguel A. Ballicora
Date: 18:07:26 09/26/01
Go up one level in this thread
On September 26, 2001 at 19:20:43, Dann Corbit wrote: >Suppose we are at some position 'p' and we are just about to submit our move... > 1) >If several of the moves took about the same time to search, we submit the move >and keep pondering on the current root. > 2) >If the key move failed high or if all the subsequent searches of non-key moves >were quick, then choose the pm to ponder instead. > >Has anybody tried it? >What is right with this idea? >What is wrong with this idea? My first attempt was to ponder all cases as (1). It was just easier, now I am testing all cases as (2) as most of the people does according to what I read here. I think that your idea deserves attention. However, it won't work any attempt to do it like (1) if you have asymetrical parameters. Somebody pointed out here to me. 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.