Computer Chess Club Archives


Search

Terms

Messages

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

Author: Ron Murawski

Date: 12:26:46 10/11/01

Go up one level in this thread


On October 11, 2001 at 15:06:31, Torstein Hall wrote:

>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.
>
>I may not be the right one to answer this, but I try anyway! (...and perhaps I
>can learn something when I' m corrected...!)
>
>I think Lazy eval. is a faster evaluation, taking fewer factors into
>consideration when evaluation is done. I guess it lets you search deeper in the
>same amount of time, if its not misslead the search down a bad branch of the
>tree.
>
>
Torstein

I'm also the wrong person to answer this, but...
Lazy Eval checks for material and passed pawns mostly.
It's a way to quickly discover that a move might lose
say, a queen. You check if this "quick score" causes a
cutoff. If so, you prune the move away and don't have
to bother with the more expensive calculations like
mobility and pawn structure. On the other hand, if the
move does not cause an immediate cutoff, you have to do
all the normal stuff, but at least you've already
calculated the material balance and scored the passed
pawns so the effort has not been wasted.

Ron



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.