Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Result of Hash Table

Author: Robert Hyatt

Date: 12:22:51 01/20/98

Go up one level in this thread


On January 20, 1998 at 14:10:49, Stuart Cracraft wrote:

>An error was discovered in the search/quiescence calling.
>
>The call to  the quiescence search was made
>after the probe to the hash table, instead of before.
>When this was moved to before the probe to the hash
>table, the probe success rate jumped up to the kinds
>of levels we're talking about here.
>
>The speed of the program jumped up 20% from 25,000 nps
>to 30,000 nps on the same test suite and the hashing
>success rate increased significantly from 14% to 40%
>for the suite.
>
>--Stuart

Your "bug" was correct.  You *always* probe before doing anything
else.  That's the point.  What you did was make the current position
probe fail by deferring it, so that a deeper position probe would
succeed. You bumped up your probe hit rate, but check out your nodes
to reach a specific depth.

The probe should be the first thing you do.  Then the null-move
search.  Then the regular search.



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.