Simplify hashfull calculation.

[stockfish] / src / tt.cpp

diff --git a/src/tt.cpp b/src/tt.cpp
index 080d3a6bd480006e4c821661d2ec9800a4b7523b..46860fe900df5b9157d3cbafa5e932c688e0de83 100644 (file)
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -148,9 +148,9 @@ TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
 int TranspositionTable::hashfull() const {
 
   int cnt = 0;
-  for (int i = 0; i < 1000 / ClusterSize; ++i)
+  for (int i = 0; i < 1000; ++i)
       for (int j = 0; j < ClusterSize; ++j)
           cnt += (table[i].entry[j].genBound8 & 0xF8) == generation8;
 
-  return cnt * 1000 / (ClusterSize * (1000 / ClusterSize));
+  return cnt / ClusterSize;
 }