/// 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;