Author: blass uri
Date: 09:03:54 05/26/00
Go up one level in this thread
On May 26, 2000 at 11:24:11, Mogens Larsen wrote: >On May 26, 2000 at 10:54:11, blass uri wrote: > >>I know it. >>I explained in the same post that a move with better evaluation is not always >>better but in most of the cases it is better. > >There's no basis for such an assumption, since you don't have the extra ply to >make it plausible. 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. Uri
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.