Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, 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
/// Thread::bestMoveCount(Move move) return best move counter for the given root move
-int Thread::best_move_count(Move move) {
+int Thread::best_move_count(Move move) const {
auto rm = std::find(rootMoves.begin() + pvIdx,
rootMoves.begin() + pvLast, move);
counterMoves.fill(MOVE_NONE);
mainHistory.fill(0);
+ lowPlyHistory.fill(0);
captureHistory.fill(0);
for (bool inCheck : { false, true })
- for (StatsType c : { NoCaptures, Captures })
- for (auto& to : continuationHistory[inCheck][c])
- for (auto& h : to)
- h->fill(0);
-
- for (bool inCheck : { false, true })
- for (StatsType c : { NoCaptures, Captures })
- continuationHistory[inCheck][c][NO_PIECE][0]->fill(Search::CounterMovePruneThreshold - 1);
+ for (StatsType c : { NoCaptures, Captures })
+ {
+ for (auto& to : continuationHistory[inCheck][c])
+ for (auto& h : to)
+ h->fill(0);
+ continuationHistory[inCheck][c][NO_PIECE][0]->fill(Search::CounterMovePruneThreshold - 1);
+ }
}
/// Thread::start_searching() wakes up the thread that will start the search
clear();
// Reallocate the hash with the new threadpool size
- TT.resize(Options["Hash"]);
+ TT.resize(size_t(Options["Hash"]));
// Init thread number dependent search params.
Search::init();
th->clear();
main()->callsCnt = 0;
- main()->previousScore = VALUE_INFINITE;
+ main()->bestPreviousScore = VALUE_INFINITE;
main()->previousTimeReduction = 1.0;
}
main()->wait_for_search_finished();
main()->stopOnPonderhit = stop = false;
+ increaseDepth = true;
main()->ponder = ponderMode;
Search::Limits = limits;
Search::RootMoves rootMoves;
for (Thread* th : *this)
{
- th->shuffleExts = th->nodes = th->tbHits = th->nmpMinPly = 0;
+ th->nodes = th->tbHits = th->nmpMinPly = th->bestMoveChanges = 0;
th->rootDepth = th->completedDepth = 0;
th->rootMoves = rootMoves;
th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th);
main()->start_searching();
}
+
+Thread* ThreadPool::get_best_thread() const {
+
+ Thread* bestThread = front();
+ std::map<Move, int64_t> votes;
+ Value minScore = VALUE_NONE;
+
+ // Find minimum score of all threads
+ for (Thread* th: *this)
+ minScore = std::min(minScore, th->rootMoves[0].score);
+
+ // Vote according to score and depth, and select the best thread
+ for (Thread* th : *this)
+ {
+ votes[th->rootMoves[0].pv[0]] +=
+ (th->rootMoves[0].score - minScore + 14) * int(th->completedDepth);
+
+ if (abs(bestThread->rootMoves[0].score) >= VALUE_TB_WIN_IN_MAX_PLY)
+ {
+ // Make sure we pick the shortest mate / TB conversion or stave off mate the longest
+ if (th->rootMoves[0].score > bestThread->rootMoves[0].score)
+ bestThread = th;
+ }
+ else if ( th->rootMoves[0].score >= VALUE_TB_WIN_IN_MAX_PLY
+ || ( th->rootMoves[0].score > VALUE_TB_LOSS_IN_MAX_PLY
+ && votes[th->rootMoves[0].pv[0]] > votes[bestThread->rootMoves[0].pv[0]]))
+ bestThread = th;
+ }
+
+ return bestThread;
+}
+
+/// Start non-main threads.
+
+void ThreadPool::start_searching() {
+
+ for (Thread* th : *this)
+ if (th != front())
+ th->start_searching();
+}
+
+/// Wait for non-main threads.
+
+void ThreadPool::wait_for_search_finished() const {
+
+ for (Thread* th : *this)
+ if (th != front())
+ th->wait_for_search_finished();
+}