Author: Mogens Larsen
Date: 10:40:32 05/26/00
Go up one level in this thread
On May 26, 2000 at 12:03:54, blass uri wrote: >There is a basis for such an assumption if the program is not stupid(otherwise >the program will not change its mind). > >It is easy to do programs that change their mind only at the end of the >iteration but programmers do not do it because it is silly not to change your >mind when most of the chances are that the new move is better. > >Suppose move A is the best move after 9 plies search. >The first move to analyze at depth 10 is always move A. > >If the program changes its mind from move A to move B at depth 10 then I can be >sure that move A will not be selcted at depth 10 even if you stop at the end of >the iteration and not in the middle of the iteration. This is still a shallow foundation to base an assumption of a better move on. If your explanation is correct, which I don't doubt, then there's little to be gained from pondering. It's only useful if you reach an extra ply and not just half an iteration. However, I do find it hard to believe that move A is discarded completely at depth 10 due to a single iteration. Is that true? Best wishes... Mogens
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.