X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Ftimeman.h;h=b1878d65f25fca5e77fade3c3765966296ac4e81;hb=b939c805139e4b37f04fbf177f580c35ebe9f130;hp=d187475fba0de2392820c9719fe5cafadc093c8a;hpb=391cd57b52a18166f90202f01f28be1f3bf24d4c;p=stockfish diff --git a/src/timeman.h b/src/timeman.h index d187475f..b1878d65 100644 --- a/src/timeman.h +++ b/src/timeman.h @@ -1,7 +1,6 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 - Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2004-2021 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 @@ -17,15 +16,36 @@ along with this program. If not, see . */ - -#if !defined(TIMEMAN_H_INCLUDED) +#ifndef TIMEMAN_H_INCLUDED #define TIMEMAN_H_INCLUDED -//// -//// Prototypes -//// +#include "misc.h" +#include "search.h" +#include "thread.h" + +namespace Stockfish { + +/// 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); + TimePoint optimum() const { return optimumTime; } + TimePoint maximum() const { return maximumTime; } + TimePoint elapsed() const { return Search::Limits.npmsec ? + TimePoint(Threads.nodes_searched()) : now() - startTime; } + + int64_t availableNodes; // When in 'nodes as time' mode + +private: + TimePoint startTime; + TimePoint optimumTime; + TimePoint maximumTime; +}; + +extern TimeManagement Time; -void get_search_times(int myTime, int myInc, int movesToGo, int currentPly, - int* maxSearchTime, int* absoluteMaxSearchTime); +} // namespace Stockfish -#endif // !defined(SEARCH_H_INCLUDED) +#endif // #ifndef TIMEMAN_H_INCLUDED