assert(PvNode || (alpha == beta - 1));
assert(depth > DEPTH_ZERO);
+ Move quietsSearched[64];
StateInfo st;
const TTEntry *tte;
SplitPoint* splitPoint;
Value bestValue, value, ttValue, eval, nullValue, futilityValue;
bool inCheck, givesCheck, pvMove, singularExtensionNode, improving;
bool captureOrPromotion, dangerous, doFullDepthSearch;
- int moveCount;
+ int moveCount, quietCount;
// Step 1. Initialize node
Thread* thisThread = pos.this_thread();
goto moves_loop;
}
- moveCount = 0;
+ moveCount = quietCount = 0;
bestValue = -VALUE_INFINITE;
ss->currentMove = threatMove = (ss+1)->excludedMove = bestMove = MOVE_NONE;
ss->ply = (ss-1)->ply + 1;
pvMove = PvNode && moveCount == 1;
ss->currentMove = move;
+ if (!SpNode && !captureOrPromotion && quietCount < 64)
+ quietsSearched[quietCount++] = move;
// Step 14. Make the move
pos.do_move(move, st, ci, givesCheck);
// played non-capture moves.
Value bonus = Value(int(depth) * int(depth));
History.update(pos.moved_piece(bestMove), to_sq(bestMove), bonus);
-
- for (const ExtMove* em = mp.quiet_moves(); em && em->move != bestMove; ++em)
- History.update(pos.moved_piece(em->move), to_sq(em->move), -bonus);
+ for (int i = 0; i < quietCount - 1; ++i)
+ {
+ Move m = quietsSearched[i];
+ History.update(pos.moved_piece(m), to_sq(m), -bonus);
+ }
if (is_ok((ss-1)->currentMove))
Countermoves.update(pos.piece_on(prevMoveSq), prevMoveSq, bestMove);