// Initialize to maximum values but unstablePVExtraTime that is reset
unstablePVExtraTime = 0;
- optimumSearchTime = maximumSearchTime = limits.time[us]; // In msec
-
- // Scale down emergencyBaseTime if we are under very high time pressure to
- // avoid moving immediately and so blundering.
- if (maximumSearchTime)
- emergencyBaseTime /= std::max(emergencyBaseTime * 100 / maximumSearchTime, 1);
+ optimumSearchTime = maximumSearchTime = limits.time[us];
// 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.
o["MultiPV"] = Option(1, 1, 500);
o["Skill Level"] = Option(20, 0, 20);
o["Emergency Move Horizon"] = Option(40, 0, 50);
- o["Emergency Base Time"] = Option(200, 0, 30000);
- o["Emergency Move Time"] = Option(70, 0, 5000);
+ o["Emergency Base Time"] = Option(50, 0, 30000);
+ o["Emergency Move Time"] = Option( 5, 0, 5000);
o["Minimum Thinking Time"] = Option(20, 0, 5000);
o["Slow Mover"] = Option(50, 10, 1000);
o["UCI_Chess960"] = Option(false);