kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 00:33:09 +00:00
Code Issues Releases Wiki Activity

VLTC time management tune

Browse source 
Result of 35k games of SPSA tuning at 180+1.8. Tuning attempt can be
found here:
https://tests.stockfishchess.org/tests/view/65e40599f2ef6c733362b03b

Passed VLTC 180+1.8:
https://tests.stockfishchess.org/tests/view/65e5a6f5416ecd92c162b5d4
LLR: 2.94 (-2.94,2.94) <0.00,2.00>
Total: 31950 W: 8225 L: 7949 D: 15776
Ptnml(0-2): 3, 3195, 9309, 3459, 9

Passed VLTC 240+2.4:
https://tests.stockfishchess.org/tests/view/65e714de0ec64f0526c3d1f1
LLR: 2.94 (-2.94,2.94) <0.50,2.50>
Total: 65108 W: 16558 L: 16202 D: 32348
Ptnml(0-2): 7, 6366, 19449, 6728, 4

closes https://github.com/official-stockfish/Stockfish/pull/5095

Bench: 1714391
This commit is contained in:
Muzhen Gaming 2024-03-04 18:48:02 +08:00 • committed by Disservin
parent 748791f80d
commit 0f01a516d2
2 changed files with 17 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
src/search.cpp
View file

@ -429,15 +429,15 @@ void Search::Worker::iterative_deepening() {
int nodesEffort = effort[bestmove.from_sq()][bestmove.to_sq()] * 100 int nodesEffort = effort[bestmove.from_sq()][bestmove.to_sq()] * 100
/ std::max(size_t(1), size_t(nodes)); / std::max(size_t(1), size_t(nodes));
double fallingEval = (66 + 14 * (mainThread->bestPreviousAverageScore - bestValue) double fallingEval = (1067 + 223 * (mainThread->bestPreviousAverageScore - bestValue)
+ 6 * (mainThread->iterValue[iterIdx] - bestValue)) + 97 * (mainThread->iterValue[iterIdx] - bestValue))
/ 616.6; / 10000.0;
fallingEval = std::clamp(fallingEval, 0.51, 1.51); fallingEval = std::clamp(fallingEval, 0.580, 1.667);
// If the bestMove is stable over several iterations, reduce time accordingly // If the bestMove is stable over several iterations, reduce time accordingly
timeReduction = lastBestMoveDepth + 8 < completedDepth ? 1.56 : 0.69; timeReduction = lastBestMoveDepth + 8 < completedDepth ? 1.495 : 0.687;
double reduction = (1.4 + mainThread->previousTimeReduction) / (2.17 * timeReduction); double reduction = (1.48 + mainThread->previousTimeReduction) / (2.17 * timeReduction);
double bestMoveInstability = 1 + 1.79 * totBestMoveChanges / threads.size(); double bestMoveInstability = 1 + 1.88 * totBestMoveChanges / threads.size();
double totalTime = double totalTime =
mainThread->tm.optimum() * fallingEval * reduction * bestMoveInstability; mainThread->tm.optimum() * fallingEval * reduction * bestMoveInstability;
@ -446,8 +446,8 @@ void Search::Worker::iterative_deepening() {
if (rootMoves.size() == 1) if (rootMoves.size() == 1)
totalTime = std::min(500.0, totalTime); totalTime = std::min(500.0, totalTime);
if (completedDepth >= 10 && nodesEffort >= 95 if (completedDepth >= 10 && nodesEffort >= 97
&& mainThread->tm.elapsed(threads.nodes_searched()) > totalTime * 3 / 4 && mainThread->tm.elapsed(threads.nodes_searched()) > totalTime * 0.739
&& !mainThread->ponder) && !mainThread->ponder)
{ {
threads.stop = true; threads.stop = true;
@ -464,7 +464,7 @@ void Search::Worker::iterative_deepening() {
threads.stop = true; threads.stop = true;
} }
else if (!mainThread->ponder else if (!mainThread->ponder
&& mainThread->tm.elapsed(threads.nodes_searched()) > totalTime * 0.50) && mainThread->tm.elapsed(threads.nodes_searched()) > totalTime * 0.506)
threads.increaseDepth = false; threads.increaseDepth = false;
else else
threads.increaseDepth = true; threads.increaseDepth = true;

14
src/timeman.cpp
View file

@ -94,17 +94,17 @@ void TimeManagement::init(Search::LimitsType& limits,
if (limits.movestogo == 0) if (limits.movestogo == 0)
{ {
// Use extra time with larger increments // Use extra time with larger increments
double optExtra = limits.inc[us] < 500 ? 1.0 : 1.1; double optExtra = limits.inc[us] < 500 ? 1.0 : 1.13;
// Calculate time constants based on current time left. // Calculate time constants based on current time left.
double optConstant = double optConstant =
std::min(0.00334 + 0.0003 * std::log10(limits.time[us] / 1000.0), 0.0049); std::min(0.00308 + 0.000319 * std::log10(limits.time[us] / 1000.0), 0.00506);
double maxConstant = std::max(3.4 + 3.0 * std::log10(limits.time[us] / 1000.0), 2.76); double maxConstant = std::max(3.39 + 3.01 * std::log10(limits.time[us] / 1000.0), 2.93);
optScale = std::min(0.0120 + std::pow(ply + 3.1, 0.44) * optConstant, optScale = std::min(0.0122 + std::pow(ply + 2.95, 0.462) * optConstant,
0.21 * limits.time[us] / double(timeLeft)) 0.213 * limits.time[us] / double(timeLeft))
* optExtra; * optExtra;
maxScale = std::min(6.9, maxConstant + ply / 12.2); maxScale = std::min(6.64, maxConstant + ply / 12.0);
} }
// x moves in y seconds (+ z increment) // x moves in y seconds (+ z increment)
@ -117,7 +117,7 @@ void TimeManagement::init(Search::LimitsType& limits,
// Limit the maximum possible time for this move // Limit the maximum possible time for this move
optimumTime = TimePoint(optScale * timeLeft); optimumTime = TimePoint(optScale * timeLeft);
maximumTime = maximumTime =
TimePoint(std::min(0.84 * limits.time[us] - moveOverhead, maxScale * optimumTime)) - 10; TimePoint(std::min(0.825 * limits.time[us] - moveOverhead, maxScale * optimumTime)) - 10;
if (options["Ponder"]) if (options["Ponder"])
optimumTime += optimumTime / 4; optimumTime += optimumTime / 4;