Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Chess Programming: "lazy eval".

Author: José Carlos

Date: 13:52:49 10/11/01

Go up one level in this thread


On October 11, 2001 at 14:42:49, Matthias Gemuh wrote:

>
>Hi Experts,
>
>What is lazy evaluation? Can I use it in AlphaBeta PV Search ?
>
>Huge Thanx,
>Matthias.

  It may have other meanings, but I implement it as follows:

  At a certain position in qsearch, you know the material balance (most of us
calculate it incremental), but you have no idea about positional score until you
call Evaluate(). If material is very low compared to alpha (for example,
alpha==0 and material==a_queen_down) then you know the positional score won't
rise the evaluation of the position above alpha, so you don't bother calling
Evaluate(), just search the captures (this is up to your implementation of
qsearch).
  Also, if material is far above beta, you can fail high on that node, because
you know the positional score won't get the eval down enough.

  Hope this helps,

  José C.



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.