mirror of
https://github.com/sockspls/badfish
synced 2025-04-29 16:23:09 +00:00
Format code using clang-format
No functional change
This commit is contained in:
parent
c115e5171e
commit
7ccde25baf
2 changed files with 5 additions and 3 deletions
|
@ -1289,8 +1289,8 @@ moves_loop: // When in check, search starts here
|
||||||
assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
|
assert(moveCount || !ss->inCheck || excludedMove || !MoveList<LEGAL>(pos).size());
|
||||||
|
|
||||||
// Adjust best value for fail high cases at non-pv nodes
|
// Adjust best value for fail high cases at non-pv nodes
|
||||||
if (!PvNode && bestValue >= beta && std::abs(bestValue) < 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)
|
&& 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);
|
bestValue = (bestValue * (depth + 2) + beta) / (depth + 3);
|
||||||
|
|
||||||
if (!moveCount)
|
if (!moveCount)
|
||||||
|
|
|
@ -212,7 +212,9 @@ Thread* ThreadPool::get_best_thread() const {
|
||||||
|
|
||||||
Thread* bestThread = threads.front();
|
Thread* bestThread = threads.front();
|
||||||
Value minScore = VALUE_NONE;
|
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
|
// Find the minimum score of all threads
|
||||||
for (Thread* th : threads)
|
for (Thread* th : threads)
|
||||||
|
|
Loading…
Add table
Reference in a new issue