Micro optimize Position::move_is_check()

More then optimization it is worth a bit of better
code self documenting.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2009-04-27 17:39:59 +02:00
parent b35e593551
commit ab69f50c64
2 changed files with 11 additions and 6 deletions
+4 -6
View File
@@ -599,19 +599,17 @@ bool Position::move_is_check(Move m, Bitboard dcCandidates) const {
case BISHOP:
return (dcCandidates && bit_is_set(dcCandidates, from))
|| ( direction_between_squares(ksq, to) != DIR_NONE
&& bit_is_set(piece_attacks<BISHOP>(ksq), to));
|| (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to));
case ROOK:
return (dcCandidates && bit_is_set(dcCandidates, from))
|| ( direction_between_squares(ksq, to) != DIR_NONE
&& bit_is_set(piece_attacks<ROOK>(ksq), to));
|| (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to));
case QUEEN:
// Discovered checks are impossible!
assert(!bit_is_set(dcCandidates, from));
return ( direction_between_squares(ksq, to) != DIR_NONE
&& bit_is_set(piece_attacks<QUEEN>(ksq), to));
return ( (direction_is_straight(ksq, to) && bit_is_set(piece_attacks<ROOK>(ksq), to))
|| (direction_is_diagonal(ksq, to) && bit_is_set(piece_attacks<BISHOP>(ksq), to)));
case KING:
// Discovered check?