kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 16:53:09 +00:00
Code Issues Releases Wiki Activity

Update stats at pv nodes

Browse source 
If a quiet best move is found at a pv node then always update stats.

STC:
LLR: 2.96 (-2.94,2.94) [-1.50,4.50]
Total: 41485 W: 8047 L: 7830 D: 25608

LTC:
LLR: 2.96 (-2.94,2.94) [0.00,6.00]
Total: 14351 W: 2420 L: 2250 D: 9681

Bench: 6985247

Resolves #330
This commit is contained in:
Stefan Geschwentner 2015-04-10 20:32:39 +01:00 • committed by Joona Kiiski
parent 36f2133df3
commit 27efc5ac99
1 changed files with 8 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
src/search.cpp
View file

@ -945,8 +945,6 @@ moves_loop: // When in check and at SpNode search starts from here
} }
ss->currentMove = move; ss->currentMove = move;
if (!SpNode && !captureOrPromotion && quietCount < 64)
quietsSearched[quietCount++] = move;
// Step 14. Make the move // Step 14. Make the move
pos.do_move(move, st, givesCheck); pos.do_move(move, st, givesCheck);
@ -1070,6 +1068,7 @@ moves_loop: // When in check and at SpNode search starts from here
rm.score = -VALUE_INFINITE; rm.score = -VALUE_INFINITE;
} }
bool newBestMove = false;
if (value > bestValue) if (value > bestValue)
{ {
bestValue = SpNode ? splitPoint->bestValue = value : value; bestValue = SpNode ? splitPoint->bestValue = value : value;
@ -1082,6 +1081,7 @@ moves_loop: // When in check and at SpNode search starts from here
&& (move != EasyMove.get(pos.key()) || moveCount > 1)) && (move != EasyMove.get(pos.key()) || moveCount > 1))
EasyMove.clear(); EasyMove.clear();
newBestMove = true;
bestMove = SpNode ? splitPoint->bestMove = move : move; bestMove = SpNode ? splitPoint->bestMove = move : move;
if (PvNode && !RootNode) // Update pv even in fail-high case if (PvNode && !RootNode) // Update pv even in fail-high case
@ -1101,6 +1101,9 @@ moves_loop: // When in check and at SpNode search starts from here
} }
} }
if (!SpNode && !captureOrPromotion && !newBestMove && quietCount < 64)
quietsSearched[quietCount++] = move;
// Step 19. Check for splitting the search // Step 19. Check for splitting the search
if ( !SpNode if ( !SpNode
&& Threads.size() >= 2 && Threads.size() >= 2
@ -1144,8 +1147,8 @@ moves_loop: // When in check and at SpNode search starts from here
: inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()]; : inCheck ? mated_in(ss->ply) : DrawValue[pos.side_to_move()];
// Quiet best move: update killers, history and countermoves // Quiet best move: update killers, history and countermoves
else if (bestValue >= beta && !pos.capture_or_promotion(bestMove)) else if (bestMove != MOVE_NONE && !pos.capture_or_promotion(bestMove))
update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount - 1); update_stats(pos, ss, bestMove, depth, quietsSearched, quietCount);
tte->save(posKey, value_to_tt(bestValue, ss->ply), tte->save(posKey, value_to_tt(bestValue, ss->ply),
bestValue >= beta ? BOUND_LOWER : bestValue >= beta ? BOUND_LOWER :
@ -1402,8 +1405,7 @@ moves_loop: // When in check and at SpNode search starts from here
*pv = MOVE_NONE; *pv = MOVE_NONE;
} }
// update_stats() updates killers, history and countermoves stats after a fail-high // update_stats() updates killers, history, countermove history and countermoves stats for a quiet best move.
// of a quiet move.
void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) { void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt) {