// Step 12. Extend checks
if ( givesCheck
&& !moveCountPruning
- && pos.see_sign(move) >= VALUE_ZERO)
+ && pos.see_ge(move, VALUE_ZERO))
extension = ONE_PLY;
// Singular extension search. If all moves but one fail low on a search of
// Prune moves with negative SEE
if ( lmrDepth < 8
- && pos.see_sign(move) < Value(-35 * lmrDepth * lmrDepth))
+ && !pos.see_ge(move, Value(-35 * lmrDepth * lmrDepth)))
continue;
}
else if ( depth < 7 * ONE_PLY
- && pos.see_sign(move) < Value(-35 * depth / ONE_PLY * depth / ONE_PLY))
+ && !pos.see_ge(move, Value(-35 * depth / ONE_PLY * depth / ONE_PLY)))
continue;
}
// because the destination square is empty.
else if ( type_of(move) == NORMAL
&& type_of(pos.piece_on(to_sq(move))) != PAWN
- && pos.see(make_move(to_sq(move), from_sq(move))) < VALUE_ZERO)
+ && !pos.see_ge(make_move(to_sq(move), from_sq(move)), VALUE_ZERO))
r -= 2 * ONE_PLY;
// Decrease/increase reduction for moves with a good/bad history
continue;
}
- if (futilityBase <= alpha && pos.see(move) <= VALUE_ZERO)
+ if (futilityBase <= alpha && !pos.see_ge(move, VALUE_ZERO + 1))
{
bestValue = std::max(bestValue, futilityBase);
continue;
// Don't search moves with negative SEE values
if ( (!InCheck || evasionPrunable)
&& type_of(move) != PROMOTION
- && pos.see_sign(move) < VALUE_ZERO)
+ && !pos.see_ge(move, VALUE_ZERO))
continue;
// Speculative prefetch as early as possible