X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftt.cpp;h=09a74d2d5936273b1a97d25358dd7c45ae63e5f4;hp=86b16c85686ea8724e6f3fc9fc7748fd273bc755;hb=25a9b601b211d0c041b483406e9160382201a487;hpb=5ef2b8c4940bd2809bc1477c0ef0b0c38b19d5f7 diff --git a/src/tt.cpp b/src/tt.cpp index 86b16c85..09a74d2d 100644 --- a/src/tt.cpp +++ b/src/tt.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -17,7 +17,6 @@ along with this program. If not, see . */ -#include #include #include @@ -60,7 +59,7 @@ void TranspositionTable::set_size(size_t mbSize) { if (!entries) { std::cerr << "Failed to allocate " << mbSize - << " MB for transposition table." << std::endl; + << "MB for transposition table." << std::endl; exit(EXIT_FAILURE); } clear(); @@ -85,7 +84,7 @@ void TranspositionTable::clear() { /// 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 Key posKey, Value v, ValueType t, Depth d, Move m, Value statV, Value kingD) { +void TranspositionTable::store(const Key posKey, Value v, Bound t, Depth d, Move m, Value statV, Value kingD) { int c1, c2, c3; TTEntry *tte, *replace; @@ -107,7 +106,7 @@ void TranspositionTable::store(const Key posKey, Value v, ValueType t, Depth d, // Implement replace strategy c1 = (replace->generation() == generation ? 2 : 0); - c2 = (tte->generation() == generation || tte->type() == VALUE_TYPE_EXACT ? -2 : 0); + c2 = (tte->generation() == generation || tte->type() == BOUND_EXACT ? -2 : 0); c3 = (tte->depth() < replace->depth() ? 1 : 0); if (c1 + c2 + c3 > 0)