Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash Table/Best Move

Author: Rick Bischoff

Date: 01:06:51 07/29/03

Go up one level in this thread


On July 29, 2003 at 03:48:29, Dann Corbit wrote:

>On July 29, 2003 at 03:44:42, Rick Bischoff wrote:
>
>>Hi all,
>>
>>I am getting the following statistic from my program:
>>
>><pre>
>> 0/18      0  1426407 Ke6 h3 Kd5 Rg2 Kc5 h4 Kb5 h5 Ka5 h6 Ka6
>>move found: 85570 not found: 118
>></pre>
>>
>>Which means of the 88570 times the hashtable didn't have a good value, it still
>>had a  good move to try first; the other 118 times it didnt have a good value,
>>it had an illegal move... Is this the kind of percentage you all see in your
>>engines?
>
>How big is your hash table?  This will be very important in understanding the
>answers.
>
>Imagine (for instance) a hash table with a single entry.  Now, imagine one with
>a trillion entries.  You get the picture.

Sorry for not including this earlier.  There are two hash tables, one for white
one for black, each with 2^22 entries.

Rick



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.