X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Ftt.cpp;h=117b60027a1678d034b88fe82ed93d7d57194266;hb=2c52147dbfdc714a0ae95982f37fc5141b225f8c;hp=01d4365522a772af5a09887106a3372d8044cd6f;hpb=bb751d6c890f5c50c642366d601740366cfae8d0;p=stockfish
diff --git a/src/tt.cpp b/src/tt.cpp
index 01d43655..117b6002 100644
--- a/src/tt.cpp
+++ b/src/tt.cpp
@@ -1,230 +1,116 @@
/*
- Glaurung, a UCI chess playing engine.
- Copyright (C) 2004-2008 Tord Romstad
+ Stockfish, a UCI chess playing engine derived from Glaurung 2.1
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
- Glaurung is free software: you can redistribute it and/or modify
+ Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
-
- Glaurung is distributed in the hope that it will be useful,
+
+ Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
-
+
You should have received a copy of the GNU General Public License
along with this program. If not, see .
*/
+#include
+#include
-////
-//// Includes
-////
-
-#include
-#include
-
+#include "bitboard.h"
#include "tt.h"
+TranspositionTable TT; // Our global transposition table
-////
-//// Functions
-////
-
-/// Constructor
-TranspositionTable::TranspositionTable(unsigned mbSize) {
- size = 0;
- generation = 0;
- writes = 0;
- entries = 0;
- this->set_size(mbSize);
-}
+/// TranspositionTable::resize() sets the size of the transposition table,
+/// measured in megabytes. Transposition table consists of a power of 2 number
+/// of clusters and each cluster consists of TTClusterSize number of TTEntry.
+void TranspositionTable::resize(size_t mbSize) {
-/// Destructor
+ size_t newClusterCount = size_t(1) << msb((mbSize * 1024 * 1024) / sizeof(TTCluster));
-TranspositionTable::~TranspositionTable() {
- delete [] entries;
-}
-
-
-/// TranspositionTable::set_size sets the size of the transposition table,
-/// measured in megabytes.
-
-void TranspositionTable::set_size(unsigned mbSize) {
- unsigned newSize;
+ if (newClusterCount == clusterCount)
+ return;
- assert(mbSize >= 4 && mbSize <= 1024);
+ clusterCount = newClusterCount;
- for(newSize = 1024; newSize * 4 * (sizeof(TTEntry)) <= (mbSize << 20);
- newSize *= 2);
- newSize /= 2;
+ free(mem);
+ mem = calloc(clusterCount * sizeof(TTCluster) + CACHE_LINE_SIZE - 1, 1);
- if(newSize != size) {
- size = newSize;
- delete [] entries;
- entries = new TTEntry[size * 4];
- if(entries == NULL) {
+ if (!mem)
+ {
std::cerr << "Failed to allocate " << mbSize
- << " MB for transposition table."
- << std::endl;
+ << "MB for transposition table." << std::endl;
exit(EXIT_FAILURE);
- }
- this->clear();
}
+
+ table = (TTCluster*)((uintptr_t(mem) + CACHE_LINE_SIZE - 1) & ~(CACHE_LINE_SIZE - 1));
}
-/// TranspositionTable::clear overwrites the entire transposition table
-/// with zeroes. It is called whenever the table is resized, or when the
+/// TranspositionTable::clear() overwrites the entire transposition table
+/// with zeroes. It is called whenever the table is resized, or when the
/// user asks the program to clear the table (from the UCI interface).
-/// Perhaps we should also clear it when the "ucinewgame" command is recieved?
void TranspositionTable::clear() {
- memset(entries, 0, size * 4 * sizeof(TTEntry));
-}
-
-/// TranspositionTable::store writes a new entry containing a position,
-/// a value, a value type, a search depth, and a best move to the
-/// transposition table. The transposition table is organized in clusters
-/// of four TTEntry objects, and when a new entry is written, it replaces
-/// the least valuable of the four entries in a cluster. A TTEntry t1 is
-/// considered to be more valuable than a TTEntry t2 if t1 is from the
-/// current search and t2 is from a previous search, or if the depth of t1
-/// is bigger than the depth of t2.
-
-void TranspositionTable::store(const Position &pos, Value v, Depth d,
- Move m, ValueType type) {
- TTEntry *tte, *replace;
-
- tte = replace = entries + int(pos.get_key() & (size - 1)) * 4;
- for(int i = 0; i < 4; i++) {
- if((tte+i)->key() == pos.get_key()) {
- if(m == MOVE_NONE)
- m = (tte+i)->move();
- *(tte+i) = TTEntry(pos.get_key(), v, type, d, m, generation);
- return;
- }
- if(replace->generation() == generation) {
- if((tte+i)->generation() != generation ||
- (tte+i)->depth() < replace->depth())
- replace = tte+i;
- }
- else if((tte+i)->generation() != generation &&
- (tte+i)->depth() < replace->depth())
- replace = tte+i;
- }
- *replace = TTEntry(pos.get_key(), v, type, d, m, generation);
- writes++;
+ std::memset(table, 0, clusterCount * sizeof(TTCluster));
}
-/// TranspositionTable::retrieve looks up the current position in the
-/// transposition table, and extracts the value, value type, depth and
-/// best move if the position is found. The return value is true if
-/// the position is found, and false if it isn't.
-
-bool TranspositionTable::retrieve(const Position &pos, Value *value,
- Depth *d, Move *move,
- ValueType *type) const {
- TTEntry *tte;
- bool found = false;
-
- tte = entries + int(pos.get_key() & (size - 1)) * 4;
- for(int i = 0; i < 4 && !found ; i++)
- if((tte+i)->key() == pos.get_key()) {
- tte = tte + i;
- found = true;
- }
- if(!found) {
- *move = MOVE_NONE;
- return false;
- }
-
- *value = tte->value();
- *type = tte->type();
- *d = tte->depth();
- *move = tte->move();
+/// TranspositionTable::probe() looks up the current position in the
+/// transposition table. Returns a pointer to the TTEntry or NULL if
+/// position is not found.
- return true;
-}
+const TTEntry* TranspositionTable::probe(const Key key) const {
+ TTEntry* const tte = first_entry(key);
+ const uint16_t key16 = key >> 48;
-/// TranspositionTable::new_search() is called at the beginning of every new
-/// search. It increments the "generation" variable, which is used to
-/// distinguish transposition table entries from previous searches from
-/// entries from the current search.
+ for (unsigned i = 0; i < TTClusterSize; ++i)
+ if (tte[i].key16 == key16)
+ {
+ tte[i].genBound8 = uint8_t(generation | tte[i].bound()); // Refresh
+ return &tte[i];
+ }
-void TranspositionTable::new_search() {
- generation++;
- writes = 0;
+ return NULL;
}
-/// TranspositionTable::insert_pv() is called at the end of a search
-/// iteration, and inserts the PV back into the PV. This makes sure the
-/// old PV moves are searched first, even if the old TT entries have been
-/// overwritten.
+/// TranspositionTable::store() writes a new entry containing position key and
+/// valuable information of current position. The lowest order bits of position
+/// key are used to decide in which cluster the position will be placed.
+/// When a new entry is written and there are no empty entries available in the
+/// cluster, it replaces the least valuable of the entries. A TTEntry t1 is considered
+/// to be more valuable than a TTEntry t2 if t1 is from the current search and t2
+/// is from a previous search, or if the depth of t1 is bigger than the depth of t2.
-void TranspositionTable::insert_pv(const Position &pos, Move pv[]) {
- UndoInfo u;
- Position p(pos);
+void TranspositionTable::store(const Key key, Value v, Bound b, Depth d, Move m, Value statV) {
- for(int i = 0; pv[i] != MOVE_NONE; i++) {
- this->store(p, VALUE_NONE, Depth(0), pv[i], VALUE_TYPE_NONE);
- p.do_move(pv[i], u);
- }
-}
+ TTEntry* const tte = first_entry(key);
+ const uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster
+ for (unsigned i = 0; i < TTClusterSize; ++i)
+ if (!tte[i].key16 || tte[i].key16 == key16) // Empty or overwrite old
+ {
+ // Save preserving any existing ttMove
+ tte[i].save(key16, v, b, d, m ? m : tte[i].move(), generation, statV);
+ return;
+ }
-/// TranspositionTable::full() returns the permill of all transposition table
-/// entries which have received at least one write during the current search.
-/// It is used to display the "info hashfull ..." information in UCI.
-
-int TranspositionTable::full() {
- double N = double(size) * 4.0;
- return int(1000 * (1 - exp(writes * log(1.0 - 1.0/N))));
-}
-
-
-/// Constructors
-
-TTEntry::TTEntry() {
-}
-
-TTEntry::TTEntry(Key k, Value v, ValueType t, Depth d, Move m,
- int generation) {
- key_ = k;
- data = (m & 0x7FFFF) | (t << 20) | (generation << 23);
- value_ = v;
- depth_ = int16_t(d);
-}
-
-
-/// Functions for extracting data from TTEntry objects.
-
-Key TTEntry::key() const {
- return key_;
-}
-
-Depth TTEntry::depth() const {
- return Depth(depth_);
-}
-
-Move TTEntry::move() const {
- return Move(data & 0x7FFFF);
-}
-
-Value TTEntry::value() const {
- return Value(value_);
-}
-
-ValueType TTEntry::type() const {
- return ValueType((data >> 20) & 3);
-}
+ // Implement replace strategy
+ TTEntry* replace = tte;
+ for (unsigned i = 1; i < TTClusterSize; ++i)
+ if ( (( tte[i].genBound8 & 0xFC) == generation || tte[i].bound() == BOUND_EXACT)
+ - ((replace->genBound8 & 0xFC) == generation)
+ - (tte[i].depth8 < replace->depth8) < 0)
+ replace = &tte[i];
-int TTEntry::generation() const {
- return (data >> 23);
+ replace->save(key16, v, b, d, m, generation, statV);
}