Author: blass uri
Date: 14:30:09 05/24/00
Go up one level in this thread
On May 24, 2000 at 17:20:29, Mike S. wrote: >On May 24, 2000 at 15:36:55, blass uri wrote: > >>The program has no idea about the difference between the best move and the >>second move. > >Really not? And how does it choose which is the best one to expect? Maybe I >would have to be a programmer to understand this. I seem to have a too simple >idea of a search tree...(?) > >Regards, >M.Scheidl You do not have to be a programmer in order to understand it. I will give you an example. Suppose the program see that 1.e4 gives 0.1 advantage for white and suppose that it also see that 1.d4 d5 gives 0.09 pawns for white. It does not have to analyze 1.d4 Nf6 in order to know that 1.e4 is better than 1.d4 (1.e4 gives 0.1 pawns for white and 1.d4 gives at most 0.09 pawns advantage). In order to save time it does not analyze 1.d4 Nf6 Suppose 1.d4 is the second best move. It cannot know what is the evaluation of 1.d4 because it may be 0.09 pawns for white if d5 is the best move for black and it may be 1 pawn for black if 1.d4 Nf6 gives 1 pawn advantage for black. 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.