Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Formula for hash table size

Author: Joost Buijs

Date: 01:41:49 08/30/03

Go up one level in this thread


On August 29, 2003 at 19:48:57, Vincent Diepeveen wrote:

>On August 29, 2003 at 07:28:57, Joost Buijs wrote:
>
>if clearing hashtable is what you do, then your program is *completely* outdated

Yes, indeed my program is outdated. But still it is able to beat the hell out of
diep.

>or has a few simple bugs.
>
>>On August 28, 2003 at 21:26:25, Robin Smith wrote:
>>
>>>On August 28, 2003 at 10:49:06, Joost Buijs wrote:
>>>
>>>>Normally how bigger the hastable the better it is.
>>>>However, the problem is that the hashtable has to be ajusted or cleared
>>>>inbetween moves, if the table gets very big this will cost noticeable time.
>>>>If you play games from lets say 3 mins/game you have on average 2 or 3
>>>>secs/move. If clearing your table takes a big part of this it can easely
>>>>degradate performance.
>>>
>>>Most programs no longer clear hashtables between moves. Why throw away
>>>information?
>>
>>I think it is a matter of taste. My program performs about equal with or without
>>clearing the tables. Without clearing I had some nasty problems, specially in
>>the endgame. Thats why I still clear the tables between moves.
>>
>>>
>>>Robin



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.