Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Weird things with hash tables.

Author: William Bryant

Date: 19:19:04 02/24/99

Go up one level in this thread


On February 24, 1999 at 21:44:34, Larry Griffiths wrote:
>William,
>
>Very nice output!  May I inquire as to how you are able to retain
>the principle continuation when using hash tables?  Mine seems to
>get messed up when using a hash table.
>
>Larry   :-}

I don't very often at the lower plies.  Note that at 18 plies on the first
example, the principle continuation is only 5 moves long.  The longer PC(or PV
as case may be) occurs when the search goes beyond the previous hashed search
and starts to back up the moves.

I am trying a suggestion of Dr. Hyatt's and not hashing the QSearch code, trying
to keep the QSearch lean.

He also suggest rebuilding the the PV from the hash table entries if they are
not overwritten.  I may try this soon (on the list, a long list :)  ) but I am
concerned about that reduction in speed it may require.

If you come up with a good trick or suggestion, let me know.

William
wbryant@ix.netcom.com







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.