Apply clang-format

Author: actions-user

search.cpp

@@ -4,10 +4,10 @@
 #include "timeman.h"
 #include "uci.h"
 #include <atomic>
+#include <iostream>
 #include <moves_io.h>
 #include <position.h>
 #include <printers.h>
-#include <iostream>
 using namespace chess;
 namespace engine {
 TranspositionTable search::tt(16);
@@ -31,50 +31,49 @@ void update_pv(Move *pv, Move move, const Move *childPv) {
 // Adjusts a mate or TB score from "plies to mate from the root" to
 // "plies to mate from the current position". Standard scores are unchanged.
 // The function is called before storing a value in the transposition table.
-Value value_to_tt(Value v, int ply) { return is_win(v) ? v + ply : is_loss(v) ? v - ply : v; }
-
+Value value_to_tt(Value v, int ply) {
+  return is_win(v) ? v + ply : is_loss(v) ? v - ply : v;
+}
 
-// Inverse of value_to_tt(): it adjusts a mate or TB score from the transposition
-// table (which refers to the plies to mate/be mated from current position) to
-// "plies to mate/be mated (TB win/loss) from the root". However, to avoid
-// potentially false mate or TB scores related to the 50 moves rule and the
-// graph history interaction, we return the highest non-TB score instead.
+// Inverse of value_to_tt(): it adjusts a mate or TB score from the
+// transposition table (which refers to the plies to mate/be mated from current
+// position) to "plies to mate/be mated (TB win/loss) from the root". However,
+// to avoid potentially false mate or TB scores related to the 50 moves rule and
+// the graph history interaction, we return the highest non-TB score instead.
 Value value_from_tt(Value v, int ply, int r50c) {
 
-    if (!is_valid(v))
-        return VALUE_NONE;
+  if (!is_valid(v))
+    return VALUE_NONE;
 
-    // handle TB win or better
-    if (is_win(v))
-    {
-        // Downgrade a potentially false mate score
-        if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 100 - r50c)
-            return VALUE_TB_WIN_IN_MAX_PLY - 1;
+  // handle TB win or better
+  if (is_win(v)) {
+    // Downgrade a potentially false mate score
+    if (v >= VALUE_MATE_IN_MAX_PLY && VALUE_MATE - v > 100 - r50c)
+      return VALUE_TB_WIN_IN_MAX_PLY - 1;
 
-        // Downgrade a potentially false TB score.
-        if (VALUE_TB - v > 100 - r50c)
-            return VALUE_TB_WIN_IN_MAX_PLY - 1;
+    // Downgrade a potentially false TB score.
+    if (VALUE_TB - v > 100 - r50c)
+      return VALUE_TB_WIN_IN_MAX_PLY - 1;
 
-        return v - ply;
-    }
+    return v - ply;
+  }
 
-    // handle TB loss or worse
-    if (is_loss(v))
-    {
-        // Downgrade a potentially false mate score.
-        if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 100 - r50c)
-            return VALUE_TB_LOSS_IN_MAX_PLY + 1;
+  // handle TB loss or worse
+  if (is_loss(v)) {
+    // Downgrade a potentially false mate score.
+    if (v <= VALUE_MATED_IN_MAX_PLY && VALUE_MATE + v > 100 - r50c)
+      return VALUE_TB_LOSS_IN_MAX_PLY + 1;
 
-        // Downgrade a potentially false TB score.
-        if (VALUE_TB + v > 100 - r50c)
-            return VALUE_TB_LOSS_IN_MAX_PLY + 1;
+    // Downgrade a potentially false TB score.
+    if (VALUE_TB + v > 100 - r50c)
+      return VALUE_TB_LOSS_IN_MAX_PLY + 1;
 
-        return v + ply;
-    }
+    return v + ply;
+  }
 
-    return v;
-}
+  return v;
 }
+} // namespace
 Value qsearch(Board &board, Value alpha, Value beta, Session &session,
               int ply = 0) {
   session.nodes++;
@@ -124,7 +123,7 @@ Value doSearch(Board &board, int depth, Value alpha, Value beta,
             Move::none());
   std::fill(std::begin(session.pv[ply + 1]), std::end(session.pv[ply + 1]),
             Move::none());
-  if (board.is_draw(3)||board.is_insufficient_material()) {
+  if (board.is_draw(3) || board.is_insufficient_material()) {
     session.nodes++;
     session.pv[ply][0] = Move::none();
     return 0;
@@ -134,7 +133,8 @@ Value doSearch(Board &board, int depth, Value alpha, Value beta,
   Move preferred = Move::none();
   if (TTEntry *entry = search::tt.lookup(hash)) {
     if (entry->getDepth() >= depth) {
-      Value ttScore = value_from_tt(entry->getScore(), ply, board.rule50_count());
+      Value ttScore =
+          value_from_tt(entry->getScore(), ply, board.rule50_count());
       TTFlag flag = entry->getFlag();
 
       if (flag == TTFlag::EXACT) {
@@ -167,7 +167,7 @@ Value doSearch(Board &board, int depth, Value alpha, Value beta,
   movepick::orderMoves(board, moves, preferred, ply);
   if (bool useNMP = depth >= 3 && !board.checkers() && ply > 0) {
     int R = 2 + depth / 6;
-    uint64_t hash_=board.hash();
+    uint64_t hash_ = board.hash();
     board.doNullMove();
     Value score =
         doSearch(board, depth - 1 - R, -beta, -beta + 1, session, ply + 1);
@@ -201,17 +201,17 @@ Value doSearch(Board &board, int depth, Value alpha, Value beta,
     Value score;
 
     if (i == 0) {
-      uint64_t hash_=board.hash();
+      uint64_t hash_ = board.hash();
       // --- First move: full window (PVS root move) ---
       score = doSearch(board, depth - 1, -beta, -alpha, session, ply + 1);
 
       if (score == VALUE_NONE) {
         board.undoMove();
         return VALUE_NONE;
       }
-      score=-score;
+      score = -score;
     } else {
-      uint64_t hash_=board.hash();
+      uint64_t hash_ = board.hash();
       // --- Null-window search (PVS + LMR) ---
       score = doSearch(board, depth - 1 - reduction, -alpha - 1, -alpha,
                        session, ply + 1);
@@ -271,7 +271,8 @@ Value doSearch(Board &board, int depth, Value alpha, Value beta,
     else
       flag = TTFlag::EXACT;
 
-    search::tt.store(hash, session.pv[ply][0], value_to_tt(maxScore, ply), depth, flag);
+    search::tt.store(hash, session.pv[ply][0], value_to_tt(maxScore, ply),
+                     depth, flag);
   }
   return maxScore;
 }