Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Why not store both a lower and an upper bound in a hashtable?

Author: Robert Hyatt

Date: 13:08:56 12/06/00

Go up one level in this thread


On December 06, 2000 at 12:45:30, Leen Ammeraal wrote:

>I have the impression that most chess programmers
>use their hashtables to store
>only one evaluation value, along with a flag
>denoting Lower, Upper, or Exact.
>Why not store both a lower and an upper bound,
>where lower = -inf or upper = +inf if only one
>real bound is available? A flag is then
>superfluous, since this follows from
>the two bound values.

If you use mtd(f) you _must_ do this.  For the other search approaches, it
probably won't help much at all, and it does use more memory.  Nothing wrong
with trying it to see what you get, of course...



>For example:
>LB      UB     Flag value (not stored)
>-inf    100    Upper
>-20     +inf   Lower
>30      30     Exact
>This also offers the possibility to store
>two different bounds at the same time, as in
>LB = -50, UB = 70.
>This is the way I do it, but, unfortunately,
>my program is weaker than most others.
>Could this be because this idea of storing
>two bounds and no flag is wrong?
>Leen Ammeraal



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.