Author: Uri Blass
Date: 11:35:53 12/25/03
Go up one level in this thread
On December 25, 2003 at 14:04:47, Christophe Theron wrote: <snipped> >By experience, no smart evaluation can compensate for the loss of one ply of >search. In theory evaluation could compensate, but in practice I don't think >anybody has ever managed to do it. I think that evaluation can compensate easily for loss of one ply of search and not only in theory because it is easy to tell your evaluation to calculate the result of 2 ply search. Evaluation by definition is a function that get a position and returns a number. If the target is not to play better but to prove that evaluation can compensate for 1 ply search then you simply tell your evaluation to perform 2 plies search. Note that some kind of search is already needed in smart evaluation even if you do not make moves. For example you cannot detect trapped pieces in evaluation without checking that every square that they can go is threatened by the opponent. You cannot detect forks in your evaluation without doing some kind of search. 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.