Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Initial Position Search Nodes

Author: Steve Maughan

Date: 09:16:33 10/10/00

Go up one level in this thread


Dan,

Your hash hit rate is way higher than mine (only 4.4%).  I'm using a two hash
table system with a depth based store criterial and an always replace criteria.
What the general consensus  - is this too simplistic?  Is a multiple hit
attempts algorithm much better?

My first move cutoff ratio is also poor at 85%.  I assume the two are linked!

Many thanks,

Steve

>Mine (Shrike) is doing this in just under 3s (1.27M nodes) on a P3/600.
>It's getting about a 35% hit rate on the hash table, so this may well
>be the problem.  Those hash table moves are really important in getting
>good move ordering (and a low branching factor).
>
>I also keep stats on the fraction of cutoffs from the first move tried
>and the fraction that are from hash table moves.  In this case I'm
>getting 92% of the cutoffs from the first move and 25% from the hash table.



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.