Author: blass uri
Date: 07:54:11 05/26/00
Go up one level in this thread
On May 26, 2000 at 10:40:49, Mogens Larsen wrote: >On May 26, 2000 at 10:01:20, blass uri wrote: > >>If we agree to define a better move as a move with a better evaluation then the >>new move is always better than the old move and it is not important if the >>program did a full iteration. > >That is not a correct definition IMO. 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. You wrote in your previous post in the same thread: "Without an extra ply or full iteration you can't be certain that the new move really is better." I assumed that when you say a better move you mean a move with better evaluation(otherwise I do not understand the point of without an extra ply or full iteration because you never can be cetain that the new move is better). 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.