Author: Will Singleton
Date: 18:22:29 06/04/04
Go up one level in this thread
On June 04, 2004 at 17:59:01, GeoffW wrote:
>Hi
>
>I was just reading my hash code and thought I could improve the storage scheme.
>
>The Hash Table Insert code was
>
>
>MYBOOL hashInsert(U64 hashCode, S32 eval, move bestMove, S32 depth, U8 flags)
>.
>.
>
>/* If the entry is a valid one and a different position with a greater depth
> than the current position then dont update the table, just return */
>
> if ((ph->code != hashCode) &&
> ((ph->flags & VALIDITY_FLAG_MASK) == VALID_FLAG) && (ph->depth > depth))
> {
> return FALSE;
> }
>
>/* else the code stores this entry irregardless of depth */
>
Since Bruce doesn't post here anymore, I'll substitute. "irregardless" is not a
word. And I second Deiter's opinion on the use of two tables.
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.