Author: Uri Blass
Date: 11:34:12 12/13/02
Go up one level in this thread
On December 13, 2002 at 14:05:51, Bas Hamstra wrote: >>A big evaluation in a very efficient program should never profit from >>lazy evaluation. > >In theory it is possible to tune your margins in such a way that lazy cuts will >not make *one* single error, and still save time. However the loss of bound info >plays a role too. For me it works. I remember my first experiments gave bad >results too. But that was when I "overdid" it. > > >Bas. I can only say that humans do lazy evaluation. humans do not calculate the exact value of positional factors when they see that they lose a queen. If I understand correctly suppose Diep calculates 1.e4 e5 2.Nf3 Qh4 3.Nxh4 and calls evaluation It does not say that it is not good based on lazy evaluation but prefers to call an expensive evaluation to find the exact value of the position. 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.