Bench: 21740192

TerjeKir · Oct 30, 2023 · 2311cfe · 2311cfe
1 parent eb32a93
commit 2311cfe
Show file tree

Hide file tree

Showing 4 changed files with 15 additions and 15 deletions.
diff --git a/src/evaluate.c b/src/evaluate.c
@@ -137,9 +137,9 @@ const int Mobility[4][28] = {
 };
 
 // KingSafety [pt-2]
-const int AttackPower[4] = { 34, 19, 30, 74 };
-const int CheckPower[4]  = { 89, 41, 71, 64 };
-const int CountModifier[8] = { 0, 0, 68, 118, 100, 127, 123, 128 };
+const int AttackPower[4] = { 35, 18, 31, 81 };
+const int CheckPower[4]  = { 85, 39, 72, 68 };
+const int CountModifier[8] = { 0, 0, 65, 124, 96, 124, 123, 128 };
 
 
 // Evaluates pawns

diff --git a/src/history.h b/src/history.h
@@ -30,17 +30,17 @@
 #define NoisyEntry(move)        (&thread->captureHistory[piece(move)][toSq(move)][PieceTypeOf(capturing(move))])
 #define ContEntry(offset, move) (&(*(ss-offset)->continuation)[piece(move)][toSq(move)])
 
-#define QuietHistoryUpdate(move, bonus)        (HistoryBonus(QuietEntry(move),        bonus,  6750))
-#define NoisyHistoryUpdate(move, bonus)        (HistoryBonus(NoisyEntry(move),        bonus, 17500))
-#define ContHistoryUpdate(offset, move, bonus) (HistoryBonus(ContEntry(offset, move), bonus, 20000))
+#define QuietHistoryUpdate(move, bonus)        (HistoryBonus(QuietEntry(move),        bonus,  6000))
+#define NoisyHistoryUpdate(move, bonus)        (HistoryBonus(NoisyEntry(move),        bonus, 16900))
+#define ContHistoryUpdate(offset, move, bonus) (HistoryBonus(ContEntry(offset, move), bonus, 21250))
 
 
 INLINE void HistoryBonus(int16_t *cur, int bonus, int div) {
     *cur += bonus - *cur * abs(bonus) / div;
 }
 
 INLINE int Bonus(Depth depth) {
-    return MIN(2170, 390 * depth - 280);
+    return MIN(2135, 400 * depth - 280);
 }
 
 INLINE void UpdateContHistories(Stack *ss, Move move, int bonus) {

diff --git a/src/movepicker.c b/src/movepicker.c
@@ -96,8 +96,8 @@ Move NextMove(MovePicker *mp) {
         case NOISY_GOOD:
             // Save seemingly bad noisy moves for later
             while ((move = PickNextMove(mp)))
-                if (    mp->list.moves[mp->list.next-1].score > 13500
-                    || (mp->list.moves[mp->list.next-1].score > -8800 && SEE(pos, move, mp->threshold)))
+                if (    mp->list.moves[mp->list.next-1].score > 13450
+                    || (mp->list.moves[mp->list.next-1].score > -9000 && SEE(pos, move, mp->threshold)))
                     return move;
                 else
                     mp->list.moves[mp->bads++].move = move;

diff --git a/src/search.c b/src/search.c
@@ -47,8 +47,8 @@ static int Reductions[2][32][32];
 CONSTR(1) InitReductions() {
     for (int depth = 1; depth < 32; ++depth)
         for (int moves = 1; moves < 32; ++moves)
-            Reductions[0][depth][moves] = 0.00 + log(depth) * log(moves) / 3.00, // capture
-            Reductions[1][depth][moves] = 1.50 + log(depth) * log(moves) / 2.05; // quiet
+            Reductions[0][depth][moves] = 0.10 + log(depth) * log(moves) / 3.00, // capture
+            Reductions[1][depth][moves] = 1.50 + log(depth) * log(moves) / 2.10; // quiet
 }
 
 // Checks if the move is in the list of searchmoves if any were given
@@ -318,17 +318,17 @@ static int AlphaBeta(Thread *thread, Stack *ss, int alpha, int beta, Depth depth
     if (   depth < 7
         && eval >= beta
         && eval - 100 * depth - (ss-1)->histScore / 300 >= beta
-        && (!ttMove || GetHistory(thread, ss, ttMove) > 7500))
+        && (!ttMove || GetHistory(thread, ss, ttMove) > 7700))
         return eval;
 
     // Null Move Pruning
     if (   eval >= beta
         && eval >= ss->eval
         && ss->eval >= beta + 140 - 15 * depth
-        && (ss-1)->histScore < 27500
+        && (ss-1)->histScore < 26000
         && pos->nonPawnCount[sideToMove] > (depth > 8)) {
 
-        Depth reduction = 3 + depth / 4 + MIN(3, (eval - beta) / 270);
+        Depth reduction = 3 + depth / 4 + MIN(3, (eval - beta) / 256);
 
         // Remember who last null-moved
         Color nullMoverTemp = thread->nullMover;
@@ -510,7 +510,7 @@ static int AlphaBeta(Thread *thread, Stack *ss, int alpha, int beta, Depth depth
 
             // Research with the same window at full depth if the reduced search failed high
             if (score > alpha && lmrDepth < newDepth) {
-                bool deeper = score > bestScore + 60 + 12 * (newDepth - lmrDepth);
+                bool deeper = score > bestScore + 55 + 13 * (newDepth - lmrDepth);
 
                 newDepth += deeper;