X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftimeman.h;h=9930a4b719042dd6cc9bf270988a92da0a728cdf;hp=35bcbee7b36b15909c8691e76c04a49a8a3a6442;hb=f2f3a06a1acfa14b3054bfd73d6c3966c326a7cc;hpb=cf0295f1ad2902badeaf9ccf6cb433314465595c diff --git a/src/timeman.h b/src/timeman.h index 35bcbee7..9930a4b7 100644 --- a/src/timeman.h +++ b/src/timeman.h @@ -1,7 +1,8 @@ /* 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 @@ -17,15 +18,31 @@ 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" + +/// 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); + int optimum() const { return optimumTime; } + 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; +}; -void get_search_times(int myTime, int myInc, int movesToGo, int currentPly, - int* maxSearchTime, int* absoluteMaxSearchTime); +extern TimeManagement Time; -#endif // !defined(TIMEMAN_H_INCLUDED) +#endif // #ifndef TIMEMAN_H_INCLUDED