Skip to content

Commit

Permalink
Format code using clang-format
Browse files Browse the repository at this point in the history
No functional change
  • Loading branch information
Disservin committed Feb 11, 2024
1 parent c115e51 commit 7ccde25
Show file tree
Hide file tree
Showing 2 changed files with 5 additions and 3 deletions.
4 changes: 2 additions & 2 deletions src/search.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1289,8 +1289,8 @@ Value Search::Worker::search(
assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());

// Adjust best value for fail high cases at non-pv nodes
if (!PvNode && bestValue >= beta && std::abs(bestValue) < VALUE_TB_WIN_IN_MAX_PLY &&
std::abs(beta) < VALUE_TB_WIN_IN_MAX_PLY && std::abs(alpha) < VALUE_TB_WIN_IN_MAX_PLY)
if (!PvNode && bestValue >= beta && std::abs(bestValue) < VALUE_TB_WIN_IN_MAX_PLY
&& std::abs(beta) < VALUE_TB_WIN_IN_MAX_PLY && std::abs(alpha) < VALUE_TB_WIN_IN_MAX_PLY)
bestValue = (bestValue * (depth + 2) + beta) / (depth + 3);

if (!moveCount)
Expand Down
4 changes: 3 additions & 1 deletion src/thread.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -212,7 +212,9 @@ Thread* ThreadPool::get_best_thread() const {

Thread* bestThread = threads.front();
Value minScore = VALUE_NONE;
std::unordered_map<Move, int64_t, Move::MoveHash> votes(2 * std::min(size(), bestThread->worker->rootMoves.size()));

std::unordered_map<Move, int64_t, Move::MoveHash> votes(
2 * std::min(size(), bestThread->worker->rootMoves.size()));

// Find the minimum score of all threads
for (Thread* th : threads)
Expand Down

0 comments on commit 7ccde25

Please sign in to comment.