/*
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) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
-#if !defined(TIMEMAN_H_INCLUDED)
+#ifndef TIMEMAN_H_INCLUDED
#define TIMEMAN_H_INCLUDED
-////
-//// Prototypes
-////
+/// The TimeManager class computes the optimal time to think depending on the
+/// maximum available time, the game move number and other parameters.
+
+class TimeManager {
+public:
+ void init(const Search::LimitsType& limits, Color us, int ply);
+ void pv_instability(double bestMoveChanges) { unstablePvFactor = 1 + bestMoveChanges; }
+ int available_time() const { return int(optimumSearchTime * unstablePvFactor * 0.71); }
+ int maximum_time() const { return maximumSearchTime; }
-void calc_search_times(const int myTime, const int myInc, const int movesToGo, const int currentPly, int &minimumSearchTime, int &maximumSearchTime);
+private:
+ int optimumSearchTime;
+ int maximumSearchTime;
+ double unstablePvFactor;
+};
-#endif // !defined(SEARCH_H_INCLUDED)
+#endif // #ifndef TIMEMAN_H_INCLUDED