Author: Vincent Diepeveen
Date: 15:00:21 12/13/02
Go up one level in this thread
On December 13, 2002 at 14:34:12, Uri Blass wrote: >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. I am not capable of knowing a single human doing lazy evaluation. they always see when they look at a position that a certain compensation is there. >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 not at all. i only evaluate leafs and here you present something without nullmove. basically all of my nodes are in nullmove somehow. the calculation and refutation of lines without a nullmove in it is a very small %. what i understand is that i outsearch many programs getting less nodes a second, programs which get more nodes a second, despite that i do not use lazy eval, no futility and i only use nullmove. O yes i nearly forgot. I also use singular extensions sometimes (but i plan to kick them out as soon as search depth allows me). Even if the difference in nodes a second is like 10 to 20 i still only get outsearched by the commercial programs like 3 ply. They use no SE then. If i kick it out it is only 1 or 2 ply at most. Somehow i can't stop smiling always when i play Tao and he claims lazy eval works when i outsearch him 2 ply. Best regards, Vincent >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.