Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: principal variation search question

Author: Pat King

Date: 19:31:29 01/29/00

Go up one level in this thread


On January 29, 2000 at 04:27:41, Tim wrote:
[snip]
>If window is alpha ~ beta, we can make sure it is correct bound.
>But window is alpha ~ alpha+1, we can not make sure it is correct bound.
We don't CARE if it's the correct bound. All we want to do is prove that it's
less than or equal to alpha, which we expect because we expect the first move to
be the right one. As long as it fails low, we don't care what the right score
is. Only if it fails high (meaning we were wrong about the best move)do we care
about the right score, and have to research the new best move in (alfa,beta)
rather than (alfa,alfa+1)



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.