/*
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-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
stdThread.join();
}
+
/// Thread::bestMoveCount(Move move) return best move counter for the given root move
int Thread::best_move_count(Move move) const {
return rm != rootMoves.begin() + pvLast ? rm->bestMoveCount : 0;
}
+
/// Thread::clear() reset histories, usually before a new game
void Thread::clear() {
}
}
+
/// Thread::start_searching() wakes up the thread that will start the search
void Thread::start_searching() {
}
}
-/// ThreadPool::clear() sets threadPool data to initial values.
+
+/// ThreadPool::clear() sets threadPool data to initial values
void ThreadPool::clear() {
main()->previousTimeReduction = 1.0;
}
+
/// ThreadPool::start_thinking() wakes up main thread waiting in idle_loop() and
/// returns immediately. Main thread will wake up other threads and start the search.
return bestThread;
}
-/// Start non-main threads.
+
+/// Start non-main threads
void ThreadPool::start_searching() {
th->start_searching();
}
-/// Wait for non-main threads.
+
+/// Wait for non-main threads
void ThreadPool::wait_for_search_finished() const {