X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftimeman.cpp;h=bc9c2e5b4b7876025d9cf86126cdeec4f242a633;hp=ba0adea527249b38080288907bc500373bca353b;hb=8de29390f2d2bd31585b93ff46eae3051126f666;hpb=9eceb894ac91b9b4a88d1972778705304666ac33 diff --git a/src/timeman.cpp b/src/timeman.cpp index ba0adea5..bc9c2e5b 100644 --- a/src/timeman.cpp +++ b/src/timeman.cpp @@ -40,7 +40,7 @@ namespace { // move_importance() is a skew-logistic function based on naive statistical // analysis of "how many games are still undecided after n half-moves". Game // is considered "undecided" as long as neither side has >275cp advantage. - // Data was extracted from CCRL game database with some simple filtering criteria. + // Data was extracted from the CCRL game database with some simple filtering criteria. double move_importance(int ply) { @@ -66,7 +66,7 @@ namespace { double ratio1 = (TMaxRatio * moveImportance) / (TMaxRatio * moveImportance + otherMovesImportance); double ratio2 = (moveImportance + TStealRatio * otherMovesImportance) / (moveImportance + otherMovesImportance); - return int(myTime * std::min(ratio1, ratio2)); // Intel C++ asks an explicit cast + return int(myTime * std::min(ratio1, ratio2)); // Intel C++ asks for an explicit cast } } // namespace @@ -91,7 +91,7 @@ void TimeManagement::init(Search::LimitsType& limits, Color us, int ply) // If we have to play in 'nodes as time' mode, then convert from time // to nodes, and use resulting values in time management formulas. // WARNING: Given npms (nodes per millisecond) must be much lower then - // real engine speed to avoid time losses. + // the real engine speed to avoid time losses. if (npmsec) { if (!availableNodes) // Only once at game start @@ -104,7 +104,6 @@ void TimeManagement::init(Search::LimitsType& limits, Color us, int ply) } startTime = limits.startTime; - unstablePvFactor = 1; optimumTime = maximumTime = std::max(limits.time[us], minThinkingTime); const int MaxMTG = limits.movestogo ? std::min(limits.movestogo, MoveHorizon) : MoveHorizon;