X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Ftimeman.h;h=b1878d65f25fca5e77fade3c3765966296ac4e81;hb=b939c805139e4b37f04fbf177f580c35ebe9f130;hp=a1d0b310f4c24491eb2439ba892a1649b8116d87;hpb=d4af15f682c1967450233ab62cba1a6c5d601df6;p=stockfish diff --git a/src/timeman.h b/src/timeman.h index a1d0b310..b1878d65 100644 --- a/src/timeman.h +++ b/src/timeman.h @@ -1,8 +1,6 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 - Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad - Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad + Copyright (C) 2004-2021 The Stockfish developers (see AUTHORS file) Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -25,26 +23,29 @@ #include "search.h" #include "thread.h" +namespace Stockfish { + /// 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); } + 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; - int optimumTime; - int maximumTime; - double unstablePvFactor; + TimePoint optimumTime; + TimePoint maximumTime; }; extern TimeManagement Time; +} // namespace Stockfish + #endif // #ifndef TIMEMAN_H_INCLUDED