kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-07-11 19:49:14 +00:00
Code Issues Releases Wiki Activity

Re-arrange history update code

Browse source 
Unify the quites moves loop for both cases,
the compiler optimizes away the

 if (is_ok((ss-1)->currentMove))

inside loop, so that the result is same
speed as original.

No functional change.
This commit is contained in:
Marco Costalba 2015-03-15 10:05:57 +01:00
parent 13d4df95cd
commit a4b2eeea75
1 changed files with 18 additions and 22 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

40
src/search.cpp
View file

@ -1396,8 +1396,8 @@ moves_loop: // When in check and at SpNode search starts from here
*pv = MOVE_NONE; *pv = MOVE_NONE;
} }
// update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high // update_stats() updates killers, history, countermoves and followupmoves
// of a quiet move. // stats after a fail-high 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) {
@ -1407,36 +1407,32 @@ moves_loop: // When in check and at SpNode search starts from here
ss->killers[0] = move; ss->killers[0] = move;
} }
// Increase history value of the cut-off move and decrease all the other
// played quiet moves.
Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY)); Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY));
History.update(pos.moved_piece(move), to_sq(move), bonus);
for (int i = 0; i < quietsCnt; ++i) Square prevSq = to_sq((ss-1)->currentMove);
{ HistoryStats& cmh = CounterMovesHistory[pos.piece_on(prevSq)][prevSq];
Move m = quiets[i];
History.update(pos.moved_piece(m), to_sq(m), -bonus); History.update(pos.moved_piece(move), to_sq(move), bonus);
}
if (is_ok((ss-1)->currentMove)) if (is_ok((ss-1)->currentMove))
{ {
Square prevMoveSq = to_sq((ss-1)->currentMove); Countermoves.update(pos.piece_on(prevSq), prevSq, move);
Piece prevMovePiece = pos.piece_on(prevMoveSq);
Countermoves.update(prevMovePiece, prevMoveSq, move);
HistoryStats& cmh = CounterMovesHistory[prevMovePiece][prevMoveSq];
cmh.update(pos.moved_piece(move), to_sq(move), bonus); cmh.update(pos.moved_piece(move), to_sq(move), bonus);
for (int i = 0; i < quietsCnt; ++i) }
{
Move m = quiets[i]; // Decrease all the other played quiet moves
cmh.update(pos.moved_piece(m), to_sq(m), -bonus); for (int i = 0; i < quietsCnt; ++i)
} {
History.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
if (is_ok((ss-1)->currentMove))
cmh.update(pos.moved_piece(quiets[i]), to_sq(quiets[i]), -bonus);
} }
if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove) if (is_ok((ss-2)->currentMove) && (ss-1)->currentMove == (ss-1)->ttMove)
{ {
Square prevOwnMoveSq = to_sq((ss-2)->currentMove); Square prevPrevSq = to_sq((ss-2)->currentMove);
Followupmoves.update(pos.piece_on(prevOwnMoveSq), prevOwnMoveSq, move); Followupmoves.update(pos.piece_on(prevPrevSq), prevPrevSq, move);
} }
} }