// Unary predicate used by std::partition to split positive values from remaining
// ones so as to sort the two sets separately, with the second sort delayed.
- inline bool has_positive_value(const ExtMove& ms) { return ms.value > 0; }
+ inline bool has_positive_value(const ExtMove& move) { return move.value > 0; }
// Picks the best move in the range (begin, end) and moves it to the front.
// It's faster than sorting all the moves in advance when there are few
std::swap(*begin, *std::max_element(begin, end));
return begin;
}
-}
+} // namespace
/// Constructors of the MovePicker class. As arguments we pass information
stage = QSEARCH_0;
else if (d > DEPTH_QS_RECAPTURES)
- {
stage = QSEARCH_1;
- // Skip TT move if is not a capture or a promotion. This avoids qsearch
- // tree explosion due to a possible perpetual check or similar rare cases
- // when TT table is full.
- if (ttm && !pos.capture_or_promotion(ttm))
- ttm = MOVE_NONE;
- }
else
{
stage = RECAPTURE;