#include <cmath>
#include "misc.h"
+#include "timeman.h"
#include "ucioption.h"
////
/// Function Prototypes
- enum TimeType { MaxTime, AbsTime };
+ enum TimeType { OptimumTime, MaxTime };
template<TimeType>
int remaining(int myTime, int movesToGo, int currentPly);
//// Functions
////
-void get_search_times(int myTime, int myInc, int movesToGo, int currentPly,
- int* maxSearchTime, int* absoluteMaxSearchTime)
+void TimeManager::pv_instability(int curChanges, int prevChanges) {
+
+ unstablePVExtraTime = curChanges * (optimumSearchTime / 2)
+ + prevChanges * (optimumSearchTime / 3);
+}
+
+void TimeManager::init(int myTime, int myInc, int movesToGo, int currentPly)
{
/* We support four different kind of time controls:
minThinkingTime :No matter what, use at least this much thinking before doing the move
*/
- int hypMTG, hypMyTime, mTime, aTime;
+ int hypMTG, hypMyTime, t1, t2;
// Read uci parameters
int emergencyMoveHorizon = get_option_value_int("Emergency Move Horizon");
int emergencyMoveTime = get_option_value_int("Emergency Move Time");
int minThinkingTime = get_option_value_int("Minimum Thinking Time");
- // Initialize variables to maximum values
- *maxSearchTime = *absoluteMaxSearchTime = myTime;
+ // Initialize to maximum values but unstablePVExtraTime that is reset
+ unstablePVExtraTime = 0;
+ optimumSearchTime = maximumSearchTime = myTime;
// We calculate optimum time usage for different hypothetic "moves to go"-values and choose the
// minimum of calculated search time values. Usually the greatest hypMTG gives the minimum values.
// Calculate thinking time for hypothetic "moves to go"-value
hypMyTime = Max(myTime + (hypMTG - 1) * myInc - emergencyBaseTime - Min(hypMTG, emergencyMoveHorizon) * emergencyMoveTime, 0);
- mTime = minThinkingTime + remaining<MaxTime>(hypMyTime, hypMTG, currentPly);
- aTime = minThinkingTime + remaining<AbsTime>(hypMyTime, hypMTG, currentPly);
+ t1 = minThinkingTime + remaining<OptimumTime>(hypMyTime, hypMTG, currentPly);
+ t2 = minThinkingTime + remaining<MaxTime>(hypMyTime, hypMTG, currentPly);
- *maxSearchTime = Min(*maxSearchTime, mTime);
- *absoluteMaxSearchTime = Min(*absoluteMaxSearchTime, aTime);
+ optimumSearchTime = Min(optimumSearchTime, t1);
+ maximumSearchTime = Min(maximumSearchTime, t2);
}
+ if (get_option_value_bool("Ponder"))
+ optimumSearchTime += optimumSearchTime / 4;
+
// Make sure that maxSearchTime is not over absoluteMaxSearchTime
- *maxSearchTime = Min(*maxSearchTime, *absoluteMaxSearchTime);
+ optimumSearchTime = Min(optimumSearchTime, maximumSearchTime);
}
////
template<TimeType T>
int remaining(int myTime, int movesToGo, int currentPly)
{
- const float TMaxRatio = (T == MaxTime ? 1 : MaxRatio);
- const float TStealRatio = (T == MaxTime ? 0 : StealRatio);
+ const float TMaxRatio = (T == OptimumTime ? 1 : MaxRatio);
+ const float TStealRatio = (T == OptimumTime ? 0 : StealRatio);
int thisMoveImportance = move_importance(currentPly);
int otherMovesImportance = 0;