Author: Dan Andersson
Date: 12:30:47 10/11/01
Go up one level in this thread
Lazy eval is a couple of things. Hashing and memoization is one, as to avoid duplication of work. And short circuiting logical expressions and delaying evaluation of an expression is another. But in chess it often denotes the case when you order the terms in the evaluation function in decreasing order and know their boundary values. And make a cutoff when the remainder of the evaluation is insufficient to stop the cutoff. The main problem with this is that some values in the hash might not be exact. That's not a big problem in ordinary a-b but can be a bother when using MTD(f). MvH Dan Andersson
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.