X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Ftimeman.h;h=a1d0b310f4c24491eb2439ba892a1649b8116d87;hb=d4af15f682c1967450233ab62cba1a6c5d601df6;hp=1333767f6ceff7268dea48b8d28f700514167bf0;hpb=57dfe41ddb9de358eb6b3aaee404b137330e1252;p=stockfish

diff --git a/src/timeman.h b/src/timeman.h
index 1333767f..a1d0b310 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-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
@@ -22,22 +23,23 @@
 
 #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 available() const { return int(optimumTime * unstablePvFactor * 1.016); }
   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;