Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Storing and reading exact- and upper bounds from hash

Author: Andreas Herrmann

Date: 04:14:56 02/02/01

Go up one level in this thread


On February 02, 2001 at 07:06:58, Ulrich Tuerke wrote:

>On February 02, 2001 at 06:44:47, Andreas Herrmann wrote:
>
>>If i work with exact- and upper bounds, sometimes my program Holmes spends the
>>opponent a figure. If i only use lower bounds, this never happens.
>>What could be the reason for this?
>>
>>Andreas
>
>One thing comes into my mind. When you store an upper bound into the hash table,
>you should not store a move, because you will not have any. There was no best
>one, because all moves had returned scores below alpha. I had neglected this for
>a while. Thus I had been always storing the last move of the move list, of
>course by far not the best but rather the worst one.
>
>Uli

Hi Uli,

i will try that, but i have the same problem with the exact bound. So i think it
must be another reason.

Andreas



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.