void TimeManagement::init(Search::LimitsType& limits, Color us, int ply) {
- TimePoint minThinkingTime = Options["Minimum Thinking Time"];
- TimePoint moveOverhead = Options["Move Overhead"];
- TimePoint slowMover = Options["Slow Mover"];
- TimePoint npmsec = Options["nodestime"];
+ TimePoint minThinkingTime = TimePoint(Options["Minimum Thinking Time"]);
+ TimePoint moveOverhead = TimePoint(Options["Move Overhead"]);
+ TimePoint slowMover = TimePoint(Options["Slow Mover"]);
+ TimePoint npmsec = TimePoint(Options["nodestime"]);
// opt_scale is a percentage of available time to use for the current move.
// max_scale is a multiplier applied to optimumTime.
// game time for the current move, so also cap to 20% of available game time.
if (limits.movestogo == 0)
{
- opt_scale = std::min(0.007 + std::pow(ply + 3.0, 0.5) / 250.0,
+ opt_scale = std::min(0.008 + std::pow(ply + 3.0, 0.5) / 250.0,
0.2 * limits.time[us] / double(timeLeft));
- max_scale = 4 + std::pow(ply + 3, 0.3);
+ max_scale = 4 + std::min(36, ply) / 12.0;
}
// x moves in y seconds (+ z increment)
}
// Never use more than 80% of the available time for this move
- optimumTime = std::max<int>(minThinkingTime, opt_scale * timeLeft);
- maximumTime = std::min(0.8 * limits.time[us] - moveOverhead, max_scale * optimumTime);
+ optimumTime = std::max(minThinkingTime, TimePoint(opt_scale * timeLeft));
+ maximumTime = TimePoint(std::min(0.8 * limits.time[us] - moveOverhead, max_scale * optimumTime));
if (Options["Ponder"])
optimumTime += optimumTime / 4;