*/
#include <algorithm>
+#include <cfloat>
#include <cmath>
#include "search.h"
double move_importance(int ply) {
- return pow((1 + exp((ply - xshift) / xscale)), -skewfactor);
+ return pow((1 + exp((ply - xshift) / xscale)), -skewfactor) + DBL_MIN; // Ensure non-zero
}
void TimeManager::pv_instability(double bestMoveChanges) {
- unstablePVExtraTime = int(bestMoveChanges * optimumSearchTime / 1.4);
+ unstablePvFactor = 1 + bestMoveChanges;
}
void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color us)
{
- /* We support four different kind of time controls:
+ /* We support four different kinds of time controls:
increment == 0 && movesToGo == 0 means: x basetime [sudden death!]
increment == 0 && movesToGo != 0 means: x moves in y minutes
int minThinkingTime = Options["Minimum Thinking Time"];
int slowMover = Options["Slow Mover"];
- // Initialize all to maximum values but unstablePVExtraTime that is reset
- unstablePVExtraTime = 0;
- optimumSearchTime = maximumSearchTime = limits.time[us];
+ // Initialize unstablePvFactor to 1 and search times to maximum values
+ unstablePvFactor = 1;
+ optimumSearchTime = maximumSearchTime = std::max(limits.time[us], minThinkingTime);
// We calculate optimum time usage for different hypothetical "moves to go"-values and choose the
// minimum of calculated search time values. Usually the greatest hypMTG gives the minimum values.