/*
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
+ Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, 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
-////
+#include "misc.h"
+#include "search.h"
+#include "thread.h"
+
+/// The TimeManagement class computes the optimal time to think depending on
+/// the maximum available time, the game move number and other parameters.
-class TimeManager {
+class TimeManagement {
public:
+ void init(Search::LimitsType& limits, Color us, int ply);
+ int optimum() const { return optimumTime; }
+ int maximum() const { return maximumTime; }
+ int elapsed() const { return int(Search::Limits.npmsec ? Threads.nodes_searched() : now() - startTime); }
- void update(int myTime, int myInc, int movesToGo, int currentPly);
- void best_move_changes(int curIter, int prevIter);
- int available_time() { return optimumSearchTime + extraSearchTime; }
+ int64_t availableNodes; // When in 'nodes as time' mode
- int optimumSearchTime;
- int maximumSearchTime;
- int extraSearchTime;
+private:
+ TimePoint startTime;
+ int optimumTime;
+ int maximumTime;
};
-#endif // !defined(TIMEMAN_H_INCLUDED)
+extern TimeManagement Time;
+
+#endif // #ifndef TIMEMAN_H_INCLUDED