mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-20 09:06:45 +08:00
Simplify time management
Tested with simplification mode SPRT[-4, 0] Passed both short TC LLR: 2.95 (-2.94,2.94) [-4.00,0.00] Total: 34102 W: 6184 L: 6144 D: 21774 And long TC LLR: 2.96 (-2.94,2.94) [-4.00,0.00] Total: 16518 W: 2647 L: 2545 D: 11326 And also 40/10 TC LLR: 2.95 (-2.94,2.94) [-4.00,0.00] Total: 22406 W: 4390 L: 4312 D: 13704 bench: 8430785
This commit is contained in:
committed by
Marco Costalba
parent
e6523e56b8
commit
72e8640f4d
@@ -60,7 +60,7 @@ namespace {
|
||||
|
||||
void TimeManager::pv_instability(double bestMoveChanges) {
|
||||
|
||||
unstablePVExtraTime = int(bestMoveChanges * optimumSearchTime / 1.4);
|
||||
unstablePvFactor = 1 + bestMoveChanges;
|
||||
}
|
||||
|
||||
|
||||
@@ -90,8 +90,8 @@ void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color u
|
||||
int minThinkingTime = Options["Minimum Thinking Time"];
|
||||
int slowMover = Options["Slow Mover"];
|
||||
|
||||
// Initialize all to maximum values but unstablePVExtraTime that is reset
|
||||
unstablePVExtraTime = 0;
|
||||
// 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
|
||||
|
||||
Reference in New Issue
Block a user