Author: Bas Hamstra
Date: 11:05:51 12/13/02
Go up one level in this thread
>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.
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.