Author: blass uri
Date: 12:12:55 05/26/00
Go up one level in this thread
On May 26, 2000 at 13:40:32, Mogens Larsen wrote: >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? Maybe there is a misunderstanding. I will describe the actions of a chess program by example: 1)end of iteration 9: time: 25 seconds best move: 1.e4 evaluation:0.12 pawn for white 2)program starts to consider e4 and only this move when it finishes the calculations we have this information time: 44 seconds best move: 1.e4 evaluation:0.1 pawn for white 3)the program starts to consider d4 It finished considering d4 and find that d4 is better and we have this information: time: 56 seconds best move: 1.d4 evaluation: 0.11 pawns for white 4) the program do the same with Nf3 and we have this information: time: 70 seconds best move: 1.Nf3 evaluation: 0.13 pawns for white 5)The program consider other moves like h3 but find they are not better. We have the following information at the end of iteration 10: time: 100 seconds best move: Nf3 evaluation: 0.13 pawns for white If the program stop at the end of iteration 9 then it is going to play 1.e4 If the program does part of the iteration(stop after 60 seconds) it can play 1.d4 that is considered to be better than 1.e4 If the program does a full iteration it will find Nf3 that is considered to be even better. I do not see something illogical here. I hope that my explanation is clear. 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.