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;
it->value = PieceValue[MG][pos.piece_on(to_sq(m))]
- Value(type_of(pos.moved_piece(m)));
- if (type_of(m) == PROMOTION)
- it->value += PieceValue[MG][promotion_type(m)] - PieceValue[MG][PAWN];
-
- else if (type_of(m) == ENPASSANT)
+ if (type_of(m) == ENPASSANT)
it->value += PieceValue[MG][PAWN];
+
+ else if (type_of(m) == PROMOTION)
+ it->value += PieceValue[MG][promotion_type(m)] - PieceValue[MG][PAWN];
}
}
case EVASION: case QSEARCH_0: case QSEARCH_1: case PROBCUT: case RECAPTURE:
stage = STOP;
+ /* Fall through */
+
case STOP:
end = cur + 1; // Avoid another next_phase() call
return;
case KILLERS_S1:
move = (cur++)->move;
if ( move != MOVE_NONE
- && pos.pseudo_legal(move)
&& move != ttMove
+ && pos.pseudo_legal(move)
&& !pos.capture(move))
return move;
break;