Author: Tord Romstad
Date: 09:35:10 06/19/04
Go up one level in this thread
On June 19, 2004 at 12:19:02, Robert Allgeuer wrote:
>Yes, I confused the two. But how would an engine measure how full its hash
>tables are; looks difficult to me?
Because the hash tables are so big, a probabilistic estimate should be good
enough.
Just count the number of times you have stored hash table entries, and compare
this to the size of you transposition table. Here is the function I use:
int hash_permill() {
double x = TT_size;
return (int) (1000 * (1 - exp(HashStores * log(1 - 1/x)))); }
>Furthermore this would mean that in most
>engines - as they do not clear hashtables after each move - this value would
>have to approach 100% during the course of a game, which I did not observe for a
>single engine so far.
I can't answer this one. I clear the transposition table (or rather, to be more
precise,
increment a generation counter) after each move.
Tord
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.