#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 now);
+ void init(Search::LimitsType& limits, Color us, int ply);
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 Search::Limits.npmsec ? Search::RootPos.nodes_searched() : now() - start; }
+ int elapsed() const { return int(Search::Limits.npmsec ? Threads.nodes_searched() : now() - startTime); }
int64_t availableNodes; // When in 'nodes as time' mode
private:
- TimePoint start;
+ TimePoint startTime;
int optimumTime;
int maximumTime;
double unstablePvFactor;