Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Alpha beta fail soft, pruning & hash bounds?

Author: Ernst A. Heinz

Date: 10:51:19 12/14/00

Go up one level in this thread


Hi Steve,

>1) Back up the hash score with the returned value as the bound and NOT alpha or
>beta.  This would give more hash cutoffs but is it accurate when one has null
>move & futility pruning etc?

Many people (myself included) use it this way and obviously
deem it accurate enough to work well in practice.

However, I always like to mention one caveat with respect
to this -- namely, properly respect all bounds on scores
as produced by earlier searches with sufficient depths
(i.e., hashed drafts) when returning the final result value.

See the electronically available preprints of my publications
on http://supertech.lcs.mit.edu/~heinz/ for details.

=Ernst=



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.