Skip to content

Commit

Permalink
Simplify move history reduction
Browse files Browse the repository at this point in the history
Recent VLTC search tuning has suggested that the depth limit can be increased
by a lot. This patch simplifies away the depth-based bonus from statScore
reduction, making the divisor a constant.
  • Loading branch information
PikaCat-OuO committed Dec 3, 2023
1 parent af87f12 commit ca44164
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions src/search.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1034,8 +1034,8 @@ Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, boo
+ (*contHist[1])[movedPiece][to_sq(move)]
+ (*contHist[3])[movedPiece][to_sq(move)] - 4017;

// Decrease/increase reduction for moves with a good/bad history (~30 Elo)
r -= ss->statScore / (11042 + 4510 * (depth > 8 && depth < 17));
// Decrease/increase reduction for moves with a good/bad history (~25 Elo)
r -= ss->statScore / 15694;

// Step 16. Late moves reduction / extension (LMR, ~98 Elo)
// We use various heuristics for the sons of a node after the first son has
Expand Down

0 comments on commit ca44164

Please sign in to comment.