/* 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 . */ #ifndef TIMEMAN_H_INCLUDED #define TIMEMAN_H_INCLUDED #include #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, int& originalPly, double& originalTimeAdjust); TimePoint optimum() const; TimePoint maximum() const; template TimePoint elapsed(FUNC nodes) const { return useNodesTime ? TimePoint(nodes()) : elapsed_time(); } TimePoint elapsed_time() const { return now() - startTime; }; void clear(); void advance_nodes_time(std::int64_t nodes); private: TimePoint startTime; TimePoint optimumTime; TimePoint maximumTime; std::int64_t availableNodes = -1; // 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