Computer Chess Club Archives

Search

Messages

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

Author: Robert Hyatt

Date: 18:20:32 02/06/01

Go up one level in this thread

On February 06, 2001 at 14:04:03, Severi Salminen wrote:

>Hi!
>
>What means lazy and plain alpha bounding as used in DarkThought? These names are
>used in Heinz's book but not described. Thanks for info.
>
>Severi


This dates back to the late 1970's.  The idea is that when you use a PVS-like
search, and fail high at the root, you do not re-search the move immediately
but just accept it as best.  If a second move fails high, you have to resolve
one of them to a true score then search the second with a null-window search
centered on the new best score.

On a single fail high, you don't do the research at all, you just proceed to
the next iteration.  Which is a bit of a problem in that you have no PV to
help order the next iteration.

• Re: What means lazy/plain alpha bounding? Severi Salminen 23:21:43 02/06/01
  • Re: What means lazy/plain alpha bounding? Robert Hyatt 07:07:00 02/07/01
    • Re: What means lazy/plain alpha bounding? Severi Salminen 13:22:12 02/07/01
      • Re: What means lazy/plain alpha bounding? Robert Hyatt 15:16:53 02/07/01
      • Re: What means lazy/plain alpha bounding? Heiner Marxen 13:33:25 02/07/01
  • Re: What means lazy/plain alpha bounding? Gian-Carlo Pascutto 01:39:55 02/07/01
    • Re: What means lazy/plain alpha bounding? Robert Hyatt 07:10:23 02/07/01
• Re: What means lazy/plain alpha bounding? Ricardo Gibert 19:09:25 02/06/01
  • Re: What means lazy/plain alpha bounding? Tony Werten 19:45:11 02/06/01

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.