X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftimeman.h;h=41befff0af500fa1dedc38ae00b2e122c5fb0dd2;hp=3cb59bbad30b6447c26738aa0a46e26c761fdd2d;hb=56d5504f6548b69ce6faaa271a8b55f3773db70c;hpb=df722521ba7027df394ed6370571cb5dc2ed6da1 diff --git a/src/timeman.h b/src/timeman.h index 3cb59bba..41befff0 100644 --- a/src/timeman.h +++ b/src/timeman.h @@ -2,6 +2,7 @@ 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-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 @@ -21,23 +22,28 @@ #define TIMEMAN_H_INCLUDED #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(const Search::LimitsType& limits, Color us, int ply, TimePoint now); - void pv_instability(double bestMoveChanges) { unstablePvFactor = 1 + bestMoveChanges; } - int available() const { return int(optimumTime * unstablePvFactor * 0.76); } - int maximum() const { return maximumTime; } - int elapsed() const { return now() - start; } + 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 start; - int optimumTime; - int maximumTime; - double unstablePvFactor; + TimePoint startTime; + TimePoint optimumTime; + TimePoint maximumTime; }; +extern TimeManagement Time; + #endif // #ifndef TIMEMAN_H_INCLUDED