Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What means lazy/plain alpha bounding?

Author: Robert Hyatt

Date: 07:10:23 02/07/01

Go up one level in this thread


On February 07, 2001 at 04:39:55, Gian-Carlo Pascutto wrote:

>On February 07, 2001 at 02:21:43, Severi Salminen wrote:
>
>>Thanks. And what is the difference between "lazy" and "plain" approaches?
>
>The 'plain' approach resolves the score immediately (by researching),
>the 'lazy' one works as Bob described.
>
>>Have you BTW tested this in Crafty
>
>I can't answer for Bob here, but I know Cray Blitz did.
>
>>(is Crafty a PVS searcher?)?
>
>Yes.
>
>--
>GCP


Cray Blitz was the first program I know of to use a null-window search after
the first move was searched with a normal window (this happened by accident
after a conversation with Murray Campbell, I believe in 1978 or 1979.)  Belle
was the first program I know of to use lazy bounding, although once I saw it
in operation, I did it in Cray Blitz.  I did remove it in the 80's somewhere
as I hated the fact that I had nothing to ponder and would often end up sitting
doing nothing, waiting on my opponent to move.  This is why I wrote the
"puzzling mode" stuff in crafty.  If I don't have a move, I flip sides and do a
short search to get something to ponder...




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.