Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: H8 perfomance and hash table size

Author: Uri Blass

Date: 22:18:35 05/19/02

Go up one level in this thread


On May 19, 2002 at 21:29:07, Pham Minh Tri wrote:

>On May 19, 2002 at 13:53:40, Uri Blass wrote:
>
>>On May 19, 2002 at 13:39:11, Gian-Carlo Pascutto wrote:
>>
>>>Most engines will have higher NPS speeds with decreasing hash.
>>>
>>>That does not mean they're faster.
>>
>>If they have higher np speeds with decresing time control it probably means
>
>For hashtable, success of hit is more important than speed. To compare, you
>should set your engine to search to given fixed depth and compare the time.

My engine does not clear the hash tables between moves so I do not think that it
searches less nodes per seconds with more hash tables.

The point is that at blitz there is no problem with the success of hit with 32
Mbytes and if 64 Mbytes does the program slower in nodes per second than 32
Mbytes are better.

Uri



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.