X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftimeman.h;h=3faba00d292498f0b1875b40d6051b455084a9c0;hp=03dc991dd842828c64219e7b26e8ae1190f3b2a9;hb=ed72a1e9ba37a9fa2674da8f46bb0597a1721c2d;hpb=dda53e831d369c5d02ccdebed1a2dcc781fc11c0 diff --git a/src/timeman.h b/src/timeman.h index 03dc991d..3faba00d 100644 --- a/src/timeman.h +++ b/src/timeman.h @@ -1,7 +1,7 @@ /* 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 @@ -17,19 +17,33 @@ 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" -class TimeManager { -public: +/// The TimeManagement class computes the optimal time to think depending on +/// the maximum available time, the game move number and other parameters. - void update(int myTime, int myInc, int movesToGo, int currentPly, - int* optimumSearchTime, int* maximumSearchTime); +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); } + + int64_t availableNodes; // When in 'nodes as time' mode + +private: + TimePoint startTime; + int optimumTime; + int maximumTime; + double unstablePvFactor; }; -#endif // !defined(TIMEMAN_H_INCLUDED) +extern TimeManagement Time; + +#endif // #ifndef TIMEMAN_H_INCLUDED