X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftimeman.h;h=41befff0af500fa1dedc38ae00b2e122c5fb0dd2;hp=46bc94e157c9fa85b5d48030b31f8dcb8a99b8f2;hb=215cd19108d97376284192c29790b42a0b0e618a;hpb=fe23c70cf163514620deba3c4ef9a3b8f4ceabb1 diff --git a/src/timeman.h b/src/timeman.h index 46bc94e1..41befff0 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-2019 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,32 @@ 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); + TimePoint optimum() const { return optimumTime; } + TimePoint maximum() const { return maximumTime; } + TimePoint elapsed() const { return Search::Limits.npmsec ? + TimePoint(Threads.nodes_searched()) : now() - startTime; } + + int64_t availableNodes; // When in 'nodes as time' mode + +private: + TimePoint startTime; + TimePoint optimumTime; + TimePoint maximumTime; +}; -void get_search_times(int myTime, int myInc, int movesToGo, int currentPly, - int* optimumSearchTime, int* maximumSearchTime); +extern TimeManagement Time; -#endif // !defined(TIMEMAN_H_INCLUDED) +#endif // #ifndef TIMEMAN_H_INCLUDED