mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-22 01:56:58 +08:00
Ressurrect hashfull patch
This is an old patch from Jean-Francois Romang to send UCI hashfull info to the GUI: https://github.com/mcostalba/Stockfish/pull/60/files It was wrongly judged as a slowdown, but it takes much less than 1 ms to run, indeed on my core i5 2.6Ghz it takes about 2 microsecs to run! Regression test is good: STC LLR: 2.96 (-2.94,2.94) [-3.00,1.00] Total: 7352 W: 1548 L: 1401 D: 4403 LTC LLR: 2.96 (-2.94,2.94) [-3.00,1.00] Total: 61432 W: 10307 L: 10251 D: 40874 I have set the name of the author to the original one. No functional change.
This commit is contained in:
committed by
Marco Costalba
parent
ce0a95c2c0
commit
a3b4e9e23c
17
src/tt.cpp
17
src/tt.cpp
@@ -96,3 +96,20 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
|
||||
|
||||
return found = false, replace;
|
||||
}
|
||||
|
||||
|
||||
/// Returns an approximation of the hashtable occupation during a search. The
|
||||
/// hash is x permill full, as per UCI protocol.
|
||||
|
||||
int TranspositionTable::hashfull() const
|
||||
{
|
||||
int cnt = 0;
|
||||
for (int i = 0; i < 1000 / ClusterSize; i++)
|
||||
{
|
||||
const TTEntry* tte = &table[i].entry[0];
|
||||
for (int j = 0; j < ClusterSize; j++)
|
||||
if ((tte[j].genBound8 & 0xFC) == generation8)
|
||||
cnt++;
|
||||
}
|
||||
return cnt;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user