Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Using just Upperbounds and Lowerbounds

Author: Tony Werten

Date: 13:27:29 02/01/01

Go up one level in this thread

On February 01, 2001 at 14:19:25, Alvaro Jose Povoa Cardoso wrote:

>Does any one tried to use just Upperbounds and Lowerbounds in hashing, ignoring
>ExactScore entries?
>My question has to do with the fact that if we use ExactScores we don´t get long
>PVs to feed in the next iteration, even if we extend PVs from hash.
>My testing shows that if we do not use ExactScore entries in the hash table, we
>end up with very long PVs that can be fed into the next iteration in order to
>aproximate the minimal tree. After all, ExactScores are rare compared to
>Upperbounds and Lowerbounds.
>
>Can someone comment on this?

One of us is missing something. The PV is always exact. If you don't store
exact, you don't have a pv. I don't know what you get from the hashtable, but it
isn't a PV.

I take my PV from hashtable and I (almost) always get a long pv, at least as
long as the search depth.

Tony

>
>Thank you
>Alvaro Cardoso

This page took 0.01 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.