Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: principal variation search question

Author: Jeremiah Penery

Date: 03:46:28 01/29/00

Go up one level in this thread


On January 29, 2000 at 04:27:41, Tim wrote:

>How can you make sure anything that fails low returns an upper bound on the
>value?

If something fails low, you know it is below alpha - that is the definition of a
fail-low.  If you return alpha, then alpha is the upper bound, because you know
it is *somewhere below* alpha.

>How can you make sure anything that fails high returns a lower bound on the
>value?

The same thing as above, but above beta instead of below alpha.



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.