mirror of
https://github.com/sockspls/badfish
synced 2025-07-12 03:59:15 +00:00
d3fc1d835e
Small improvement of the elapsed time usage in search, makes the code easier to read overall. Also Search::Worker::iterative_deepening() now only checks the elapsed time once, instead of 3 times in a row. Non Regression STC: https://tests.stockfishchess.org/tests/view/6617005d5a4693796d965c3c LLR: 2.97 (-2.94,2.94) <-1.75,0.25> Total: 61024 W: 16002 L: 15806 D: 29216 Ptnml(0-2): 243, 6874, 16102, 7030, 263 closes https://github.com/official-stockfish/Stockfish/pull/5163 No functional change
62 lines
1.8 KiB
C++
62 lines
1.8 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (C) 2004-2024 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
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
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 <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef TIMEMAN_H_INCLUDED
|
|
#define TIMEMAN_H_INCLUDED
|
|
|
|
#include <cstdint>
|
|
|
|
#include "misc.h"
|
|
#include "types.h"
|
|
|
|
namespace Stockfish {
|
|
|
|
class OptionsMap;
|
|
|
|
namespace Search {
|
|
struct LimitsType;
|
|
}
|
|
|
|
// The TimeManagement class computes the optimal time to think depending on
|
|
// the maximum available time, the game move number, and other parameters.
|
|
class TimeManagement {
|
|
public:
|
|
void init(Search::LimitsType& limits, Color us, int ply, const OptionsMap& options);
|
|
|
|
TimePoint optimum() const;
|
|
TimePoint maximum() const;
|
|
template<typename FUNC>
|
|
TimePoint elapsed(FUNC nodes) const {
|
|
return useNodesTime ? TimePoint(nodes()) : now() - startTime;
|
|
}
|
|
|
|
void clear();
|
|
void advance_nodes_time(std::int64_t nodes);
|
|
|
|
private:
|
|
TimePoint startTime;
|
|
TimePoint optimumTime;
|
|
TimePoint maximumTime;
|
|
|
|
std::int64_t availableNodes = 0; // When in 'nodes as time' mode
|
|
bool useNodesTime = false; // True if we are in 'nodes as time' mode
|
|
};
|
|
|
|
} // namespace Stockfish
|
|
|
|
#endif // #ifndef TIMEMAN_H_INCLUDED
|