Value DrawValue[COLOR_NB];
History Hist;
Gains Gain;
- RefutationTable Refutation;
+ Refutations Refutation;
template <NodeType NT>
Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth);
split_point_start: // At split points actual search starts from here
- Move prevMove = (ss-1)->currentMove;
- Square prevSq = to_sq(prevMove);
- Piece prevP = pos.piece_on(prevSq);
- Move refutationMove = Refutation.get(prevP, prevSq);
-
- MovePicker mp(pos, ttMove, depth, Hist, ss, refutationMove, PvNode ? -VALUE_INFINITE : beta);
+ MovePicker mp(pos, ttMove, depth, Hist, Refutation, ss, PvNode ? -VALUE_INFINITE : beta);
CheckInfo ci(pos);
value = bestValue; // Workaround a bogus 'uninitialized' warning under gcc
singularExtensionNode = !RootNode
// Increase history value of the cut-off move
Value bonus = Value(int(depth) * int(depth));
Hist.update(pos.piece_moved(bestMove), to_sq(bestMove), bonus);
- Refutation.update(prevP, prevSq, bestMove);
+ if (is_ok((ss-1)->currentMove))
+ {
+ Square prevSq = to_sq((ss-1)->currentMove);
+ Refutation.update(pos.piece_on(prevSq), prevSq, bestMove);
+ }
// Decrease history of all the other played non-capture moves
for (int i = 0; i < playedMoveCount - 1; i++)