jirayu_sri/stockfish
1
0
Fork 0
mirror of https://github.com/official-stockfish/Stockfish.git synced 2026-07-22 12:47:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

VVLTC Search Tune

Browse Source 
alues were tuned with 125k VVLTC games.

Passed VVLTC 1st sprt:
https://tests.stockfishchess.org/tests/view/68865feb7b562f5f7b731341
LLR: 2.95 (-2.94,2.94) <0.00,2.00>
Total: 39640 W: 10380 L: 10109 D: 19151
Ptnml(0-2): 5, 3556, 12424, 3833, 2

Passed VVLTC 2nd sprt:
https://tests.stockfishchess.org/tests/view/68864dfa7b562f5f7b7312ee
LLR: 2.95 (-2.94,2.94) <0.50,2.50>
Total: 25972 W: 6807 L: 6537 D: 12628
Ptnml(0-2): 0, 2294, 8132, 2556, 4

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

Bench: 3143696
This commit is contained in:
Muzhen Gaming
2025-07-28 19:33:00 +02:00
committed by Joost VandeVondele
parent a516b517d3
commit 90c83c381f
1 changed files with 81 additions and 81 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+81 -81
View File
@@ -83,7 +83,7 @@ int correction_value(const Worker& w, const Position& pos, const Stack* const ss
m.is_ok() ? (*(ss - 2)->continuationCorrectionHistory)[pos.piece_on(m.to_sq())][m.to_sq()]
: 0;
return 7696 * pcv + 7689 * micv + 9708 * (wnpcv + bnpcv) + 6978 * cntcv;
return 8867 * pcv + 8136 * micv + 10757 * (wnpcv + bnpcv) + 7232 * cntcv;
}
// Add correctionHistory value to raw staticEval and guarantee evaluation
@@ -99,11 +99,11 @@ void update_correction_history(const Position& pos,
const Move m = (ss - 1)->currentMove;
const Color us = pos.side_to_move();
static constexpr int nonPawnWeight = 172;
static constexpr int nonPawnWeight = 165;
workerThread.pawnCorrectionHistory[pawn_structure_index<Correction>(pos)][us]
<< bonus * 111 / 128;
workerThread.minorPieceCorrectionHistory[minor_piece_index(pos)][us] << bonus * 151 / 128;
<< bonus * 128 / 128;
workerThread.minorPieceCorrectionHistory[minor_piece_index(pos)][us] << bonus * 153 / 128;
workerThread.nonPawnCorrectionHistory[non_pawn_index<WHITE>(pos)][WHITE][us]
<< bonus * nonPawnWeight / 128;
workerThread.nonPawnCorrectionHistory[non_pawn_index<BLACK>(pos)][BLACK][us]
@@ -111,7 +111,7 @@ void update_correction_history(const Position& pos,
if (m.is_ok())
(*(ss - 2)->continuationCorrectionHistory)[pos.piece_on(m.to_sq())][m.to_sq()]
<< bonus * 141 / 128;
<< bonus * 153 / 128;
}
// Add a small random component to draw evaluations to avoid 3-fold blindness
@@ -288,7 +288,7 @@ void Search::Worker::iterative_deepening() {
int searchAgainCounter = 0;
lowPlyHistory.fill(86);
lowPlyHistory.fill(89);
// Iterative deepening loop until requested to stop or the target depth is reached
while (++rootDepth < MAX_PLY && !threads.stop
@@ -324,13 +324,13 @@ void Search::Worker::iterative_deepening() {
selDepth = 0;
// Reset aspiration window starting size
delta = 5 + std::abs(rootMoves[pvIdx].meanSquaredScore) / 11134;
delta = 5 + std::abs(rootMoves[pvIdx].meanSquaredScore) / 11131;
Value avg = rootMoves[pvIdx].averageScore;
alpha = std::max(avg - delta, -VALUE_INFINITE);
beta = std::min(avg + delta, VALUE_INFINITE);
// Adjust optimism based on root move's averageScore
optimism[us] = 137 * avg / (std::abs(avg) + 91);
optimism[us] = 136 * avg / (std::abs(avg) + 93);
optimism[~us] = -optimism[us];
// Start with a small aspiration window and, in the case of a fail
@@ -538,9 +538,9 @@ void Search::Worker::undo_null_move(Position& pos) { pos.undo_null_move(); }
// Reset histories, usually before a new game
void Search::Worker::clear() {
mainHistory.fill(67);
captureHistory.fill(-688);
pawnHistory.fill(-1287);
mainHistory.fill(64);
captureHistory.fill(-753);
pawnHistory.fill(-1275);
pawnCorrectionHistory.fill(5);
minorPieceCorrectionHistory.fill(0);
nonPawnCorrectionHistory.fill(0);
@@ -555,10 +555,10 @@ void Search::Worker::clear() {
for (StatsType c : {NoCaptures, Captures})
for (auto& to : continuationHistory[inCheck][c])
for (auto& h : to)
h.fill(-473);
h.fill(-494);
for (size_t i = 1; i < reductions.size(); ++i)
reductions[i] = int(2796 / 128.0 * std::log(i));
reductions[i] = int(2782 / 128.0 * std::log(i));
refreshTable.clear(networks[numaAccessToken]);
}
@@ -681,16 +681,16 @@ Value Search::Worker::search(
// Bonus for a quiet ttMove that fails high
if (!ttCapture)
update_quiet_histories(pos, ss, *this, ttData.move,
std::min(125 * depth - 77, 1157));
std::min(127 * depth - 74, 1063));
// Extra penalty for early quiet moves of the previous ply
if (prevSq != SQ_NONE && (ss - 1)->moveCount <= 3 && !priorCapture)
update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq, -2301);
update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq, -2128);
}
// Partial workaround for the graph history interaction problem
// For high rule50 counts don't produce transposition table cutoffs.
if (pos.rule50_count() < 90)
if (pos.rule50_count() < 91)
{
if (depth >= 8 && ttData.move && pos.pseudo_legal(ttData.move) && pos.legal(ttData.move)
&& !is_decisive(ttData.value))
@@ -803,11 +803,11 @@ Value Search::Worker::search(
// Use static evaluation difference to improve quiet move ordering
if (((ss - 1)->currentMove).is_ok() && !(ss - 1)->inCheck && !priorCapture && !ttHit)
{
int bonus = std::clamp(-10 * int((ss - 1)->staticEval + ss->staticEval), -1858, 1492) + 661;
mainHistory[~us][((ss - 1)->currentMove).from_to()] << bonus * 1057 / 1024;
int bonus = std::clamp(-10 * int((ss - 1)->staticEval + ss->staticEval), -1979, 1561) + 630;
mainHistory[~us][((ss - 1)->currentMove).from_to()] << bonus * 935 / 1024;
if (type_of(pos.piece_on(prevSq)) != PAWN && ((ss - 1)->currentMove).type_of() != PROMOTION)
pawnHistory[pawn_structure_index(pos)][pos.piece_on(prevSq)][prevSq]
<< bonus * 1266 / 1024;
<< bonus * 1428 / 1024;
}
// Set up the improving flag, which is true if current static evaluation is
@@ -820,26 +820,26 @@ Value Search::Worker::search(
if (priorReduction >= 3 && !opponentWorsening)
depth++;
if (priorReduction >= 1 && depth >= 2 && ss->staticEval + (ss - 1)->staticEval > 175)
if (priorReduction >= 2 && depth >= 2 && ss->staticEval + (ss - 1)->staticEval > 177)
depth--;
// Step 7. Razoring
// If eval is really low, skip search entirely and return the qsearch value.
// For PvNodes, we must have a guard against mates being returned.
if (!PvNode && eval < alpha - 486 - 325 * depth * depth)
if (!PvNode && eval < alpha - 495 - 290 * depth * depth)
return qsearch<NonPV>(pos, ss, alpha, beta);
// Step 8. Futility pruning: child node
// The depth condition is important for mate finding.
{
auto futility_margin = [&](Depth d) {
Value futilityMult = 93 - 20 * (cutNode && !ss->ttHit);
Value futilityMult = 90 - 20 * (cutNode && !ss->ttHit);
return futilityMult * d //
- improving * futilityMult * 2 //
- opponentWorsening * futilityMult / 3 //
+ (ss - 1)->statScore / 376 //
+ std::abs(correctionValue) / 168639;
+ (ss - 1)->statScore / 356 //
+ std::abs(correctionValue) / 171290;
};
if (!ss->ttPv && depth < 14 && eval - futility_margin(depth) >= beta && eval >= beta
@@ -849,7 +849,7 @@ Value Search::Worker::search(
// Step 9. Null move search with verification search
if (cutNode && (ss - 1)->currentMove != Move::null()
&& ss->staticEval >= beta - 19 * depth + 389 && !excludedMove && pos.non_pawn_material(us)
&& ss->staticEval >= beta - 19 * depth + 403 && !excludedMove && pos.non_pawn_material(us)
&& ss->ply >= nmpMinPly && !is_loss(beta))
{
// Null move dynamic reduction based on depth
@@ -886,7 +886,7 @@ Value Search::Worker::search(
}
}
improving |= ss->staticEval >= beta + 94;
improving |= ss->staticEval >= beta + 87;
// Step 10. Internal iterative reductions
// At sufficient depth, reduce depth for PV/Cut nodes without a TTMove.
@@ -897,7 +897,7 @@ Value Search::Worker::search(
// Step 11. ProbCut
// If we have a good enough capture (or queen promotion) and a reduced search
// returns a value much above beta, we can (almost) safely prune the previous move.
probCutBeta = beta + 201 - 58 * improving;
probCutBeta = beta + 215 - 60 * improving;
if (depth >= 3
&& !is_decisive(beta)
// If value from transposition table is lower than probCutBeta, don't attempt
@@ -953,7 +953,7 @@ Value Search::Worker::search(
moves_loop: // When in check, search starts here
// Step 12. A small Probcut idea
probCutBeta = beta + 400;
probCutBeta = beta + 417;
if ((ttData.bound & BOUND_LOWER) && ttData.depth >= depth - 4 && ttData.value >= probCutBeta
&& !is_decisive(beta) && is_valid(ttData.value) && !is_decisive(ttData.value))
return probCutBeta;
@@ -1017,7 +1017,7 @@ moves_loop: // When in check, search starts here
// Smaller or even negative value is better for short time controls
// Bigger value is better for long time controls
if (ss->ttPv)
r += 968;
r += 931;
// Step 14. Pruning at shallow depth.
// Depth conditions are important for mate finding.
@@ -1038,7 +1038,7 @@ moves_loop: // When in check, search starts here
// Futility pruning for captures
if (!givesCheck && lmrDepth < 7 && !ss->inCheck)
{
Value futilityValue = ss->staticEval + 232 + 224 * lmrDepth
Value futilityValue = ss->staticEval + 222 + 216 * lmrDepth
+ PieceValue[capturedPiece] + 131 * captHist / 1024;
if (futilityValue <= alpha)
continue;
@@ -1067,21 +1067,21 @@ moves_loop: // When in check, search starts here
+ pawnHistory[pawn_structure_index(pos)][movedPiece][move.to_sq()];
// Continuation history based pruning
if (history < -4229 * depth)
if (history < -4361 * depth)
continue;
history += 68 * mainHistory[us][move.from_to()] / 32;
history += 71 * mainHistory[us][move.from_to()] / 32;
lmrDepth += history / 3388;
lmrDepth += history / 3233;
Value baseFutility = (bestMove ? 46 : 230);
Value futilityValue =
ss->staticEval + baseFutility + 117 * lmrDepth + 102 * (ss->staticEval > alpha);
ss->staticEval + baseFutility + 131 * lmrDepth + 91 * (ss->staticEval > alpha);
// Futility pruning: parent node
// (*Scaler): Generally, more frequent futility pruning
// scales well with respect to time and threads
if (!ss->inCheck && lmrDepth < 12 && futilityValue <= alpha)
if (!ss->inCheck && lmrDepth < 11 && futilityValue <= alpha)
{
if (bestValue <= futilityValue && !is_decisive(bestValue)
&& !is_win(futilityValue))
@@ -1092,7 +1092,7 @@ moves_loop: // When in check, search starts here
lmrDepth = std::max(lmrDepth, 0);
// Prune moves with negative SEE
if (!pos.see_ge(move, -27 * lmrDepth * lmrDepth))
if (!pos.see_ge(move, -26 * lmrDepth * lmrDepth))
continue;
}
}
@@ -1109,11 +1109,11 @@ moves_loop: // When in check, search starts here
// and lower extension margins scale well.
if (!rootNode && move == ttData.move && !excludedMove
&& depth >= 6 - (completedDepth > 27) + ss->ttPv && is_valid(ttData.value)
&& depth >= 6 - (completedDepth > 26) + ss->ttPv && is_valid(ttData.value)
&& !is_decisive(ttData.value) && (ttData.bound & BOUND_LOWER)
&& ttData.depth >= depth - 3)
{
Value singularBeta = ttData.value - (58 + 76 * (ss->ttPv && !PvNode)) * depth / 57;
Value singularBeta = ttData.value - (56 + 79 * (ss->ttPv && !PvNode)) * depth / 58;
Depth singularDepth = newDepth / 2;
ss->excludedMove = move;
@@ -1122,11 +1122,11 @@ moves_loop: // When in check, search starts here
if (value < singularBeta)
{
int corrValAdj = std::abs(correctionValue) / 248400;
int doubleMargin = -4 + 244 * PvNode - 206 * !ttCapture - corrValAdj
- 997 * ttMoveHistory / 131072 - (ss->ply > rootDepth) * 47;
int tripleMargin = 84 + 269 * PvNode - 253 * !ttCapture + 91 * ss->ttPv - corrValAdj
- (ss->ply * 2 > rootDepth * 3) * 54;
int corrValAdj = std::abs(correctionValue) / 249096;
int doubleMargin = 4 + 205 * PvNode - 223 * !ttCapture - corrValAdj
- 959 * ttMoveHistory / 131072 - (ss->ply > rootDepth) * 45;
int tripleMargin = 80 + 276 * PvNode - 249 * !ttCapture + 86 * ss->ttPv - corrValAdj
- (ss->ply * 2 > rootDepth * 3) * 53;
extension =
1 + (value < singularBeta - doubleMargin) + (value < singularBeta - tripleMargin);
@@ -1176,14 +1176,14 @@ moves_loop: // When in check, search starts here
// Decrease reduction for PvNodes (*Scaler)
if (ss->ttPv)
r -= 2437 + PvNode * 926 + (ttData.value > alpha) * 901
r -= 2510 + PvNode * 963 + (ttData.value > alpha) * 916
+ (ttData.depth >= depth) * (943 + cutNode * 1180);
// These reduction adjustments have no proven non-linear scaling
r += 650; // Base reduction offset to compensate for other tweaks
r -= moveCount * 66;
r -= std::abs(correctionValue) / 28047;
r -= moveCount * 69;
r -= std::abs(correctionValue) / 27160;
// Increase reduction for cut nodes
if (cutNode)
@@ -1195,16 +1195,16 @@ moves_loop: // When in check, search starts here
// Increase reduction if next ply has a lot of fail high
if ((ss + 1)->cutoffCnt > 2)
r += 1036 + allNode * 848;
r += 935 + allNode * 763;
r += (ss + 1)->quietMoveStreak * 50;
r += (ss + 1)->quietMoveStreak * 51;
// For first picked move (ttMove) reduce reduction
if (move == ttData.move)
r -= 2006;
r -= 2043;
if (capture)
ss->statScore = 826 * int(PieceValue[pos.captured_piece()]) / 128
ss->statScore = 782 * int(PieceValue[pos.captured_piece()]) / 128
+ captureHistory[movedPiece][move.to_sq()][type_of(pos.captured_piece())];
else
ss->statScore = 2 * mainHistory[us][move.from_to()]
@@ -1212,7 +1212,7 @@ moves_loop: // When in check, search starts here
+ (*contHist[1])[movedPiece][move.to_sq()];
// Decrease/increase reduction for moves with a good/bad history
r -= ss->statScore * 826 / 8192;
r -= ss->statScore * 789 / 8192;
// Step 17. Late moves reduction / extension (LMR)
if (depth >= 2 && moveCount > 1)
@@ -1237,7 +1237,7 @@ moves_loop: // When in check, search starts here
{
// Adjust full-depth search based on LMR results - if the result was
// good enough search deeper, if it was bad enough search shallower.
const bool doDeeperSearch = value > (bestValue + 42 + 2 * newDepth);
const bool doDeeperSearch = value > (bestValue + 43 + 2 * newDepth);
const bool doShallowerSearch = value < bestValue + 9;
newDepth += doDeeperSearch - doShallowerSearch;
@@ -1246,7 +1246,7 @@ moves_loop: // When in check, search starts here
value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha, newDepth, !cutNode);
// Post LMR continuation history updates
update_continuation_histories(ss, movedPiece, move.to_sq(), 1508);
update_continuation_histories(ss, movedPiece, move.to_sq(), 1412);
}
else if (value > alpha && value < bestValue + 9)
newDepth--;
@@ -1257,7 +1257,7 @@ moves_loop: // When in check, search starts here
{
// Increase reduction if ttMove is not present
if (!ttData.move)
r += 1128;
r += 1139;
// Note that if expected reduction is high, we reduce search depth here
value = -search<NonPV>(pos, ss + 1, -(alpha + 1), -alpha,
@@ -1343,7 +1343,7 @@ moves_loop: // When in check, search starts here
// In case we have an alternative move equal in eval to the current bestmove,
// promote it to bestmove by pretending it just exceeds alpha (but not beta).
int inc = (value == bestValue && ss->ply + 2 >= rootDepth && (int(nodes) & 15) == 0
int inc = (value == bestValue && ss->ply + 2 >= rootDepth && (int(nodes) & 14) == 0
&& !is_win(std::abs(value) + 1));
if (value + inc > bestValue)
@@ -1406,31 +1406,31 @@ moves_loop: // When in check, search starts here
update_all_stats(pos, ss, *this, bestMove, prevSq, quietsSearched, capturesSearched, depth,
ttData.move, moveCount);
if (!PvNode)
ttMoveHistory << (bestMove == ttData.move ? 800 : -879);
ttMoveHistory << (bestMove == ttData.move ? 811 : -848);
}
// Bonus for prior quiet countermove that caused the fail low
else if (!priorCapture && prevSq != SQ_NONE)
{
int bonusScale = -220;
bonusScale += std::min(-(ss - 1)->statScore / 103, 323);
bonusScale += std::min(73 * depth, 531);
bonusScale += 174 * ((ss - 1)->moveCount > 8);
bonusScale += 144 * (!ss->inCheck && bestValue <= ss->staticEval - 104);
bonusScale += 128 * (!(ss - 1)->inCheck && bestValue <= -(ss - 1)->staticEval - 82);
int bonusScale = -215;
bonusScale += std::min(-(ss - 1)->statScore / 103, 337);
bonusScale += std::min(64 * depth, 552);
bonusScale += 177 * ((ss - 1)->moveCount > 8);
bonusScale += 141 * (!ss->inCheck && bestValue <= ss->staticEval - 94);
bonusScale += 141 * (!(ss - 1)->inCheck && bestValue <= -(ss - 1)->staticEval - 76);
bonusScale = std::max(bonusScale, 0);
const int scaledBonus = std::min(159 * depth - 94, 1501) * bonusScale;
const int scaledBonus = std::min(155 * depth - 88, 1416) * bonusScale;
update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq,
scaledBonus * 412 / 32768);
scaledBonus * 397 / 32768);
mainHistory[~us][((ss - 1)->currentMove).from_to()] << scaledBonus * 203 / 32768;
mainHistory[~us][((ss - 1)->currentMove).from_to()] << scaledBonus * 224 / 32768;
if (type_of(pos.piece_on(prevSq)) != PAWN && ((ss - 1)->currentMove).type_of() != PROMOTION)
pawnHistory[pawn_structure_index(pos)][pos.piece_on(prevSq)][prevSq]
<< scaledBonus * 1040 / 32768;
<< scaledBonus * 1127 / 32768;
}
// Bonus for prior capture countermove that caused the fail low
@@ -1438,7 +1438,7 @@ moves_loop: // When in check, search starts here
{
Piece capturedPiece = pos.captured_piece();
assert(capturedPiece != NO_PIECE);
captureHistory[pos.piece_on(prevSq)][prevSq][type_of(capturedPiece)] << 1080;
captureHistory[pos.piece_on(prevSq)][prevSq][type_of(capturedPiece)] << 1042;
}
if (PvNode)
@@ -1588,7 +1588,7 @@ Value Search::Worker::qsearch(Position& pos, Stack* ss, Value alpha, Value beta)
if (bestValue > alpha)
alpha = bestValue;
futilityBase = ss->staticEval + 376;
futilityBase = ss->staticEval + 352;
}
const PieceToHistory* contHist[] = {(ss - 1)->continuationHistory,
@@ -1649,7 +1649,7 @@ Value Search::Worker::qsearch(Position& pos, Stack* ss, Value alpha, Value beta)
if (!capture
&& (*contHist[0])[pos.moved_piece(move)][move.to_sq()]
+ pawnHistory[pawn_structure_index(pos)][pos.moved_piece(move)][move.to_sq()]
<= 6218)
<= 5868)
continue;
// Do not search moves with bad enough SEE values
@@ -1735,7 +1735,7 @@ Value Search::Worker::qsearch(Position& pos, Stack* ss, Value alpha, Value beta)
Depth Search::Worker::reduction(bool i, Depth d, int mn, int delta) const {
int reductionScale = reductions[d] * reductions[mn];
return reductionScale - delta * 794 / rootDelta + !i * reductionScale * 205 / 512 + 1086;
return reductionScale - delta * 731 / rootDelta + !i * reductionScale * 216 / 512 + 1089;
}
// elapsed() returns the time elapsed since the search started. If the
@@ -1831,35 +1831,35 @@ void update_all_stats(const Position& pos,
Piece movedPiece = pos.moved_piece(bestMove);
PieceType capturedPiece;
int bonus = std::min(143 * depth - 89, 1496) + 302 * (bestMove == ttMove);
int malus = std::min(737 * depth - 179, 3141) - 30 * moveCount;
int bonus = std::min(142 * depth - 88, 1501) + 318 * (bestMove == ttMove);
int malus = std::min(757 * depth - 172, 2848) - 30 * moveCount;
if (!pos.capture_stage(bestMove))
{
update_quiet_histories(pos, ss, workerThread, bestMove, bonus * 1059 / 1024);
update_quiet_histories(pos, ss, workerThread, bestMove, bonus * 1054 / 1024);
// Decrease stats for all non-best quiet moves
for (Move move : quietsSearched)
update_quiet_histories(pos, ss, workerThread, move, -malus * 1310 / 1024);
update_quiet_histories(pos, ss, workerThread, move, -malus * 1388 / 1024);
}
else
{
// Increase stats for the best move in case it was a capture move
capturedPiece = type_of(pos.piece_on(bestMove.to_sq()));
captureHistory[movedPiece][bestMove.to_sq()][capturedPiece] << bonus * 1213 / 1024;
captureHistory[movedPiece][bestMove.to_sq()][capturedPiece] << bonus * 1235 / 1024;
}
// Extra penalty for a quiet early move that was not a TT move in
// previous ply when it gets refuted.
if (prevSq != SQ_NONE && ((ss - 1)->moveCount == 1 + (ss - 1)->ttHit) && !pos.captured_piece())
update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq, -malus * 580 / 1024);
update_continuation_histories(ss - 1, pos.piece_on(prevSq), prevSq, -malus * 595 / 1024);
// Decrease stats for all non-best capture moves
for (Move move : capturesSearched)
{
movedPiece = pos.moved_piece(move);
capturedPiece = type_of(pos.piece_on(move.to_sq()));
captureHistory[movedPiece][move.to_sq()][capturedPiece] << -malus * 1388 / 1024;
captureHistory[movedPiece][move.to_sq()][capturedPiece] << -malus * 1354 / 1024;
}
}
@@ -1868,7 +1868,7 @@ void update_all_stats(const Position& pos,
// at ply -1, -2, -3, -4, and -6 with current move.
void update_continuation_histories(Stack* ss, Piece pc, Square to, int bonus) {
static constexpr std::array<ConthistBonus, 6> conthist_bonuses = {
{{1, 1092}, {2, 631}, {3, 294}, {4, 517}, {5, 126}, {6, 445}}};
{{1, 1108}, {2, 652}, {3, 273}, {4, 572}, {5, 126}, {6, 449}}};
static constexpr int conthist_offsets[6]{71, 106, -22, -20, 29, -74};
@@ -1892,14 +1892,14 @@ void update_quiet_histories(
workerThread.mainHistory[us][move.from_to()] << bonus; // Untuned to prevent duplicate effort
if (ss->ply < LOW_PLY_HISTORY_SIZE)
workerThread.lowPlyHistory[ss->ply][move.from_to()] << (bonus * 792 / 1024) + 40;
workerThread.lowPlyHistory[ss->ply][move.from_to()] << (bonus * 771 / 1024) + 40;
update_continuation_histories(ss, pos.moved_piece(move), move.to_sq(),
bonus * (bonus > 0 ? 1082 : 784) / 1024);
bonus * (bonus > 0 ? 979 : 842) / 1024);
int pIndex = pawn_structure_index(pos);
workerThread.pawnHistory[pIndex][pos.moved_piece(move)][move.to_sq()]
<< (bonus * (bonus > 0 ? 705 : 450) / 1024) + 70;
<< (bonus * (bonus > 0 ? 704 : 439) / 1024) + 70;
}
}