Author: Gian-Carlo Pascutto
Date: 08:14:53 08/28/03
Go up one level in this thread
On August 28, 2003 at 10:46:26, Peter Fendrich wrote: >Let's assume that I allocate 256Mb for a 30 minutes blitz game and have enough >RAM to do so. Then there will be "no" conflicts or overwrites to mention. The >hash table "hit rate" will be the optimal for my program. Now let's lower the >size to 128Mb. I will get the same hash table "hit rate" with less RAM. If I >continue to lower the size my "hit rate" will at some point start to decrease. >When distributing memory between main hash table, KingPawn hash table, Nalimov >cashe and other tables I would like to know in advance a reasonable priority >scheme. >This is only a problem when the allocated RAM is low enough to make conflicts. >For instance the KP hash table size can be set to a more or less fixed value >for all situations but at some point it is more optimal to use some of it for >the main hash table instead. I think requiring the user to input things like the pawn hash table size is rather silly. How should he know what a good value is? Why not let the engine determine a good value automatically? I think all professional programs do this. Just enter the total size and let the engine figure out the distribution. -- GCP
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.