Author: Gabor Szots
Date: 04:27:30 01/16/06
Go up one level in this thread
>Is there not theoretically an optimum amount of hash for engines dependent upon >the time control used. >For example it would be disadvantageous to use too much hash at blitz time >controls whereas it would be disadvantageous to use too little at long time >controls? >That's my understanding, but some tell me that it's a contentious issue. >Hope I'm not opening a can of worms here! > >Graham. I try to explain mainly in the hope that some of the cognoscenti will correct my stupid mistakes. Each position has a hash key which serves as an index to the hash table. The program does not have to examine the whole hash table if an entry for that position exists. It will immediately find the right place using the key. Therefore the time used for hash table access is roughly independent from its size. However, it can hurt if the hash table is too small. There will not be enough places to store values, and values not found have to be calculated over and over again. So, bigger is better. Just make sure you have enough mmemory. You have only take care not that the hash table fits into your RAM. Gábor
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.