2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
5 Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
21 #include <cstring> // For std::memset
31 TranspositionTable TT; // Our global transposition table
33 /// TTEntry::save populates the TTEntry with a new node's data, possibly
34 /// overwriting an old position. Update is not atomic and can be racy.
36 void TTEntry::save(Key k, Value v, bool pv, Bound b, Depth d, Move m, Value ev) {
38 assert(d / ONE_PLY * ONE_PLY == d);
40 // Preserve any existing move for the same position
41 if (m || (k >> 48) != key16)
44 // Overwrite less valuable entries
45 if ( (k >> 48) != key16
46 || d / ONE_PLY + 10 > depth8
49 key16 = (uint16_t)(k >> 48);
52 genBound8 = (uint8_t)(TT.generation8 | uint8_t(pv) << 2 | b);
53 assert((d - DEPTH_NONE) / ONE_PLY >= 0);
54 depth8 = (uint8_t)((d - DEPTH_NONE) / ONE_PLY);
59 /// TranspositionTable::resize() sets the size of the transposition table,
60 /// measured in megabytes. Transposition table consists of a power of 2 number
61 /// of clusters and each cluster consists of ClusterSize number of TTEntry.
63 void TranspositionTable::resize(size_t mbSize) {
65 Threads.main()->wait_for_search_finished();
67 clusterCount = mbSize * 1024 * 1024 / sizeof(Cluster);
70 mem = malloc(clusterCount * sizeof(Cluster) + CacheLineSize - 1);
74 std::cerr << "Failed to allocate " << mbSize
75 << "MB for transposition table." << std::endl;
79 table = (Cluster*)((uintptr_t(mem) + CacheLineSize - 1) & ~(CacheLineSize - 1));
84 /// TranspositionTable::clear() initializes the entire transposition table to zero,
85 // in a multi-threaded way.
87 void TranspositionTable::clear() {
89 std::vector<std::thread> threads;
91 for (size_t idx = 0; idx < Options["Threads"]; ++idx)
93 threads.emplace_back([this, idx]() {
95 // Thread binding gives faster search on systems with a first-touch policy
96 if (Options["Threads"] > 8)
97 WinProcGroup::bindThisThread(idx);
99 // Each thread will zero its part of the hash table
100 const size_t stride = clusterCount / Options["Threads"],
101 start = stride * idx,
102 len = idx != Options["Threads"] - 1 ?
103 stride : clusterCount - start;
105 std::memset(&table[start], 0, len * sizeof(Cluster));
109 for (std::thread& th: threads)
113 /// TranspositionTable::probe() looks up the current position in the transposition
114 /// table. It returns true and a pointer to the TTEntry if the position is found.
115 /// Otherwise, it returns false and a pointer to an empty or least valuable TTEntry
116 /// to be replaced later. The replace value of an entry is calculated as its depth
117 /// minus 8 times its relative age. TTEntry t1 is considered more valuable than
118 /// TTEntry t2 if its replace value is greater than that of t2.
120 TTEntry* TranspositionTable::probe(const Key key, bool& found) const {
122 TTEntry* const tte = first_entry(key);
123 const uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster
125 for (int i = 0; i < ClusterSize; ++i)
126 if (!tte[i].key16 || tte[i].key16 == key16)
128 tte[i].genBound8 = uint8_t(generation8 | (tte[i].genBound8 & 0x7)); // Refresh
130 return found = (bool)tte[i].key16, &tte[i];
133 // Find an entry to be replaced according to the replacement strategy
134 TTEntry* replace = tte;
135 for (int i = 1; i < ClusterSize; ++i)
136 // Due to our packed storage format for generation and its cyclic
137 // nature we add 263 (256 is the modulus plus 7 to keep the unrelated
138 // lowest three bits from affecting the result) to calculate the entry
139 // age correctly even after generation8 overflows into the next cycle.
140 if ( replace->depth8 - ((263 + generation8 - replace->genBound8) & 0xF8)
141 > tte[i].depth8 - ((263 + generation8 - tte[i].genBound8) & 0xF8))
144 return found = false, replace;
148 /// TranspositionTable::hashfull() returns an approximation of the hashtable
149 /// occupation during a search. The hash is x permill full, as per UCI protocol.
151 int TranspositionTable::hashfull() const {
154 for (int i = 0; i < 1000 / ClusterSize; ++i)
155 for (int j = 0; j < ClusterSize; ++j)
156 cnt += (table[i].entry[j].genBound8 & 0xF8) == generation8;
158 return cnt * 1000 / (ClusterSize * (1000 / ClusterSize));