/*
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
-struct SearchLimits;
+#include "misc.h"
+#include "search.h"
+#include "thread.h"
-class TimeManager {
+/// 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);
+ void pv_instability(double bestMoveChanges) { unstablePvFactor = 1 + bestMoveChanges; }
+ int available() const { return int(optimumTime * unstablePvFactor * 1.016); }
+ int maximum() const { return maximumTime; }
+ int elapsed() const { return int(Search::Limits.npmsec ? Threads.nodes_searched() : now() - startTime); }
- void init(const Search::LimitsType& limits, int currentPly);
- void pv_instability(int curChanges, int prevChanges);
- int available_time() const { return optimumSearchTime + unstablePVExtraTime; }
- int maximum_time() const { return maximumSearchTime; }
+ int64_t availableNodes; // When in 'nodes as time' mode
private:
- int optimumSearchTime;
- int maximumSearchTime;
- int unstablePVExtraTime;
+ TimePoint startTime;
+ int optimumTime;
+ int maximumTime;
+ double unstablePvFactor;
};
-#endif // !defined(TIMEMAN_H_INCLUDED)
+extern TimeManagement Time;
+
+#endif // #ifndef TIMEMAN_H_INCLUDED