/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author) Copyright (C) 2008 Marco Costalba
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008-2009 Marco Costalba
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#include <cassert>
+#include "bitcount.h"
#include "movegen.h"
// Simple macro to wrap a very common while loop, no facny, no flexibility,
// hardcoded list name 'mlist' and from square 'from'.
#define SERIALIZE_MOVES(b) while (b) (*mlist++).move = make_move(from, pop_1st_bit(&b))
+// Version used for pawns, where the 'from' square is given as a delta from the 'to' square
+#define SERIALIZE_MOVES_D(b, d) while (b) { to = pop_1st_bit(&b); (*mlist++).move = make_move(to + (d), to); }
+
////
//// Local definitions
////
QUEEN_SIDE
};
- // Function
- bool castling_is_check(const Position&, CastlingSide);
+ enum MoveType {
+ CAPTURE,
+ NON_CAPTURE,
+ CHECK,
+ EVASION
+ };
- // Template
+ // Helper templates
template<CastlingSide Side>
MoveStack* generate_castle_moves(const Position&, MoveStack*);
- // Template generate_pawn_captures() with specializations
- template<Color, Color, Bitboard, SquareDelta, SquareDelta, SquareDelta>
- MoveStack* do_generate_pawn_captures(const Position& pos, MoveStack* mlist);
+ template<Color Us, MoveType Type>
+ MoveStack* generate_pawn_moves(const Position&, MoveStack*, Bitboard, Square);
+
+ // Template generate_piece_moves (captures and non-captures) with specializations and overloads
+ template<PieceType>
+ MoveStack* generate_piece_moves(const Position&, MoveStack*, Color, Bitboard);
- template<Color>
- inline MoveStack* generate_pawn_captures(const Position& p, MoveStack* m) {
- return do_generate_pawn_captures<WHITE, BLACK, Rank8BB, DELTA_NE, DELTA_NW, DELTA_N>(p, m);
- }
template<>
- inline MoveStack* generate_pawn_captures<BLACK>(const Position& p, MoveStack* m) {
- return do_generate_pawn_captures<BLACK, WHITE, Rank1BB, DELTA_SE, DELTA_SW, DELTA_S>(p, m);
- }
+ MoveStack* generate_piece_moves<KING>(const Position&, MoveStack*, Color, Bitboard);
- // Template generate_pawn_noncaptures() with specializations
- template<Color, Color, Bitboard, Bitboard, SquareDelta, SquareDelta, SquareDelta>
- MoveStack* do_generate_pawn_noncaptures(const Position& pos, MoveStack* mlist);
+ template<PieceType Piece, MoveType Type>
+ inline MoveStack* generate_piece_moves(const Position& p, MoveStack* m, Color us, Bitboard t) {
- template<Color>
- inline MoveStack* generate_pawn_noncaptures(const Position& p, MoveStack* m) {
- return do_generate_pawn_noncaptures<WHITE, BLACK, Rank8BB, Rank3BB, DELTA_NE, DELTA_NW, DELTA_N>(p, m);
- }
- template<>
- inline MoveStack* generate_pawn_noncaptures<BLACK>(const Position& p, MoveStack* m) {
- return do_generate_pawn_noncaptures<BLACK, WHITE, Rank1BB, Rank6BB, DELTA_SE, DELTA_SW, DELTA_S>(p, m);
- }
+ assert(Piece == PAWN);
+ assert(Type == CAPTURE || Type == NON_CAPTURE || Type == EVASION);
- // Template generate_pawn_blocking_evasions() with specializations
- template<Color Us, Rank, Bitboard, SquareDelta>
- MoveStack* do_generate_pawn_blocking_evasions(const Position& pos, Bitboard not_pinned,
- Bitboard blockSquares, MoveStack* mlist);
- template<Color>
- inline MoveStack* generate_pawn_blocking_evasions(const Position& p, Bitboard np, Bitboard bs, MoveStack* m) {
- return do_generate_pawn_blocking_evasions<WHITE, RANK_8, Rank3BB, DELTA_N>(p, np, bs, m);
- }
- template<>
- inline MoveStack* generate_pawn_blocking_evasions<BLACK>(const Position& p, Bitboard np, Bitboard bs, MoveStack* m) {
- return do_generate_pawn_blocking_evasions<BLACK, RANK_1, Rank6BB, DELTA_S>(p, np, bs, m);
+ return (us == WHITE ? generate_pawn_moves<WHITE, Type>(p, m, t, SQ_NONE)
+ : generate_pawn_moves<BLACK, Type>(p, m, t, SQ_NONE));
}
- // Template generate_pawn_checks() with specializations
- template<Color, Color, Bitboard, Bitboard, SquareDelta>
- MoveStack* do_generate_pawn_checks(const Position&, Bitboard, Square, MoveStack*);
+ // Templates for non-capture checks generation
- template<Color>
- inline MoveStack* generate_pawn_checks(const Position& p, Bitboard dc, Square ksq, MoveStack* m) {
- return do_generate_pawn_checks<WHITE, BLACK, Rank8BB, Rank3BB, DELTA_N>(p, dc, ksq, m);
- }
- template<>
- inline MoveStack* generate_pawn_checks<BLACK>(const Position& p, Bitboard dc, Square ksq, MoveStack* m) {
- return do_generate_pawn_checks<BLACK, WHITE, Rank1BB, Rank6BB, DELTA_S>(p, dc, ksq, m);
- }
+ template<PieceType Piece>
+ MoveStack* generate_discovered_checks(const Position&, MoveStack*, Square);
- // non-pawn templates
template<PieceType>
- MoveStack* generate_piece_moves(const Position&, MoveStack*, Color us, Bitboard);
- template<>
- MoveStack* generate_piece_moves<KING>(const Position& pos, MoveStack* mlist, Color us, Bitboard target);
+ MoveStack* generate_direct_checks(const Position&, MoveStack*, Color, Bitboard, Square);
- template<PieceType>
- MoveStack* generate_piece_checks(const Position&, Bitboard, Bitboard, Square, MoveStack*);
- MoveStack* generate_piece_checks_king(const Position&, Square, Bitboard, Square, MoveStack*);
+ template<>
+ inline MoveStack* generate_direct_checks<PAWN>(const Position& p, MoveStack* m, Color us, Bitboard dc, Square ksq) {
- template<PieceType>
- MoveStack* generate_piece_blocking_evasions(const Position&, Bitboard, Bitboard, MoveStack*);
+ return (us == WHITE ? generate_pawn_moves<WHITE, CHECK>(p, m, dc, ksq)
+ : generate_pawn_moves<BLACK, CHECK>(p, m, dc, ksq));
+ }
}
////
-/// generate_captures generates() all pseudo-legal captures and queen
-/// promotions. The return value is the number of moves generated.
+/// generate_captures() generates all pseudo-legal captures and queen
+/// promotions. Returns a pointer to the end of the move list.
-int generate_captures(const Position& pos, MoveStack* mlist) {
+MoveStack* generate_captures(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
assert(!pos.is_check());
Color us = pos.side_to_move();
Bitboard target = pos.pieces_of_color(opposite_color(us));
- MoveStack* mlist_start = mlist;
mlist = generate_piece_moves<QUEEN>(pos, mlist, us, target);
mlist = generate_piece_moves<ROOK>(pos, mlist, us, target);
mlist = generate_piece_moves<BISHOP>(pos, mlist, us, target);
mlist = generate_piece_moves<KNIGHT>(pos, mlist, us, target);
-
- if (us == WHITE)
- mlist = generate_pawn_captures<WHITE>(pos, mlist);
- else
- mlist = generate_pawn_captures<BLACK>(pos, mlist);
-
- mlist = generate_piece_moves<KING>(pos, mlist, us, target);
- return int(mlist - mlist_start);
+ mlist = generate_piece_moves<PAWN, CAPTURE>(pos, mlist, us, target);
+ return generate_piece_moves<KING>(pos, mlist, us, target);
}
/// generate_noncaptures() generates all pseudo-legal non-captures and
-/// underpromotions. The return value is the number of moves generated.
+/// underpromotions. Returns a pointer to the end of the move list.
-int generate_noncaptures(const Position& pos, MoveStack* mlist) {
+MoveStack* generate_noncaptures(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
assert(!pos.is_check());
Color us = pos.side_to_move();
Bitboard target = pos.empty_squares();
- MoveStack* mlist_start = mlist;
-
- if (us == WHITE)
- mlist = generate_pawn_noncaptures<WHITE>(pos, mlist);
- else
- mlist = generate_pawn_noncaptures<BLACK>(pos, mlist);
+ mlist = generate_piece_moves<PAWN, NON_CAPTURE>(pos, mlist, us, target);
mlist = generate_piece_moves<KNIGHT>(pos, mlist, us, target);
mlist = generate_piece_moves<BISHOP>(pos, mlist, us, target);
mlist = generate_piece_moves<ROOK>(pos, mlist, us, target);
mlist = generate_piece_moves<QUEEN>(pos, mlist, us, target);
mlist = generate_piece_moves<KING>(pos, mlist, us, target);
mlist = generate_castle_moves<KING_SIDE>(pos, mlist);
- mlist = generate_castle_moves<QUEEN_SIDE>(pos, mlist);
- return int(mlist - mlist_start);
+ return generate_castle_moves<QUEEN_SIDE>(pos, mlist);
}
-/// generate_checks() generates all pseudo-legal non-capturing, non-promoting
-/// checks. It returns the number of generated moves.
+/// generate_non_capture_checks() generates all pseudo-legal non-captures and knight
+/// underpromotions that give check. Returns a pointer to the end of the move list.
-int generate_checks(const Position& pos, MoveStack* mlist, Bitboard dc) {
+MoveStack* generate_non_capture_checks(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
assert(!pos.is_check());
+ Bitboard b, dc;
+ Square from;
Color us = pos.side_to_move();
Square ksq = pos.king_square(opposite_color(us));
- MoveStack* mlist_start = mlist;
- assert(pos.piece_on(ksq) == king_of_color(opposite_color(us)));
+ assert(pos.piece_on(ksq) == piece_of_color_and_type(opposite_color(us), KING));
- dc = pos.discovered_check_candidates(us);
+ // Discovered non-capture checks
+ b = dc = pos.discovered_check_candidates(us);
- // Pawn moves
- if (us == WHITE)
- mlist = generate_pawn_checks<WHITE>(pos, dc, ksq, mlist);
- else
- mlist = generate_pawn_checks<BLACK>(pos, dc, ksq, mlist);
-
- // Pieces moves
- Bitboard b = pos.knights(us);
- if (b)
- mlist = generate_piece_checks<KNIGHT>(pos, b, dc, ksq, mlist);
-
- b = pos.bishops(us);
- if (b)
- mlist = generate_piece_checks<BISHOP>(pos, b, dc, ksq, mlist);
-
- b = pos.rooks(us);
- if (b)
- mlist = generate_piece_checks<ROOK>(pos, b, dc, ksq, mlist);
-
- b = pos.queens(us);
- if (b)
- mlist = generate_piece_checks<QUEEN>(pos, b, dc, ksq, mlist);
-
- // Hopefully we always have a king ;-)
- mlist = generate_piece_checks_king(pos, pos.king_square(us), dc, ksq, mlist);
-
- // Castling moves that give check. Very rare but nice to have!
- if ( pos.can_castle_queenside(us)
- && (square_rank(ksq) == square_rank(pos.king_square(us)) || square_file(ksq) == FILE_D)
- && castling_is_check(pos, QUEEN_SIDE))
- mlist = generate_castle_moves<QUEEN_SIDE>(pos, mlist);
-
- if ( pos.can_castle_kingside(us)
- && (square_rank(ksq) == square_rank(pos.king_square(us)) || square_file(ksq) == FILE_F)
- && castling_is_check(pos, KING_SIDE))
- mlist = generate_castle_moves<KING_SIDE>(pos, mlist);
+ while (b)
+ {
+ from = pop_1st_bit(&b);
+ switch (pos.type_of_piece_on(from))
+ {
+ case PAWN: /* Will be generated togheter with pawns direct checks */ break;
+ case KNIGHT: mlist = generate_discovered_checks<KNIGHT>(pos, mlist, from); break;
+ case BISHOP: mlist = generate_discovered_checks<BISHOP>(pos, mlist, from); break;
+ case ROOK: mlist = generate_discovered_checks<ROOK>(pos, mlist, from); break;
+ case KING: mlist = generate_discovered_checks<KING>(pos, mlist, from); break;
+ default: assert(false); break;
+ }
+ }
- return int(mlist - mlist_start);
+ // Direct non-capture checks
+ mlist = generate_direct_checks<PAWN>(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks<KNIGHT>(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks<BISHOP>(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks<ROOK>(pos, mlist, us, dc, ksq);
+ return generate_direct_checks<QUEEN>(pos, mlist, us, dc, ksq);
}
-/// generate_evasions() generates all check evasions when the side to move is
-/// in check. Unlike the other move generation functions, this one generates
-/// only legal moves. It returns the number of generated moves. This
-/// function is very ugly, and needs cleaning up some time later. FIXME
+/// generate_evasions() generates all pseudo-legal check evasions when
+/// the side to move is in check. Returns a pointer to the end of the move list.
-int generate_evasions(const Position& pos, MoveStack* mlist) {
+MoveStack* generate_evasions(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
assert(pos.is_check());
- Square from, to;
+ Bitboard b, target;
+ Square from, checksq;
+ int checkersCnt = 0;
Color us = pos.side_to_move();
- Color them = opposite_color(us);
Square ksq = pos.king_square(us);
- MoveStack* mlist_start = mlist;
-
- assert(pos.piece_on(ksq) == king_of_color(us));
-
- // Generate evasions for king
- Bitboard b1 = pos.piece_attacks<KING>(ksq) & ~pos.pieces_of_color(us);
- Bitboard b2 = pos.occupied_squares();
- clear_bit(&b2, ksq);
-
- while (b1)
- {
- to = pop_1st_bit(&b1);
-
- // Make sure 'to' is not attacked by the other side. This is a bit ugly,
- // because we can't use Position::square_is_attacked. Instead we use
- // the low-level bishop_attacks_bb and rook_attacks_bb with the bitboard
- // b2 (the occupied squares with the king removed) in order to test whether
- // the king will remain in check on the destination square.
- if (!( (pos.piece_attacks<KNIGHT>(to) & pos.knights(them))
- || (pos.pawn_attacks(us, to) & pos.pawns(them))
- || (bishop_attacks_bb(to, b2) & pos.bishops_and_queens(them))
- || (rook_attacks_bb(to, b2) & pos.rooks_and_queens(them))
- || (pos.piece_attacks<KING>(to) & pos.kings(them))))
-
- (*mlist++).move = make_move(ksq, to);
- }
-
- // Generate evasions for other pieces only if not double check. We use a
- // simple bit twiddling hack here rather than calling count_1s in order to
- // save some time (we know that pos.checkers() has at most two nonzero bits).
Bitboard checkers = pos.checkers();
+ Bitboard sliderAttacks = EmptyBoardBB;
- if (!(checkers & (checkers - 1))) // Only one bit set?
- {
- Square checksq = first_1(checkers);
-
- assert(pos.color_of_piece_on(checksq) == them);
+ assert(pos.piece_on(ksq) == piece_of_color_and_type(us, KING));
+ assert(checkers);
- // Find pinned pieces
- Bitboard not_pinned = ~pos.pinned_pieces(us);
-
- // Generate captures of the checking piece
-
- // Pawn captures
- b1 = pos.pawn_attacks(them, checksq) & pos.pawns(us) & not_pinned;
- while (b1)
- {
- from = pop_1st_bit(&b1);
- if (relative_rank(us, checksq) == RANK_8)
- {
- (*mlist++).move = make_promotion_move(from, checksq, QUEEN);
- (*mlist++).move = make_promotion_move(from, checksq, ROOK);
- (*mlist++).move = make_promotion_move(from, checksq, BISHOP);
- (*mlist++).move = make_promotion_move(from, checksq, KNIGHT);
- } else
- (*mlist++).move = make_move(from, checksq);
- }
+ // Find squares attacked by slider checkers, we will remove
+ // them from the king evasions set so to early skip known
+ // illegal moves and avoid an useless legality check later.
+ b = checkers;
+ do
+ {
+ checkersCnt++;
+ checksq = pop_1st_bit(&b);
- // Pieces captures
- b1 = ( (pos.piece_attacks<KNIGHT>(checksq) & pos.knights(us))
- | (pos.piece_attacks<BISHOP>(checksq) & pos.bishops_and_queens(us))
- | (pos.piece_attacks<ROOK>(checksq) & pos.rooks_and_queens(us)) ) & not_pinned;
+ assert(pos.color_of_piece_on(checksq) == opposite_color(us));
- while (b1)
+ switch (pos.type_of_piece_on(checksq))
{
- from = pop_1st_bit(&b1);
- (*mlist++).move = make_move(from, checksq);
+ case BISHOP: sliderAttacks |= BishopPseudoAttacks[checksq]; break;
+ case ROOK: sliderAttacks |= RookPseudoAttacks[checksq]; break;
+ case QUEEN:
+ // In case of a queen remove also squares attacked in the other direction to
+ // avoid possible illegal moves when queen and king are on adjacent squares.
+ if (direction_is_straight(checksq, ksq))
+ sliderAttacks |= RookPseudoAttacks[checksq] | pos.attacks_from<BISHOP>(checksq);
+ else
+ sliderAttacks |= BishopPseudoAttacks[checksq] | pos.attacks_from<ROOK>(checksq);
+ default:
+ break;
}
+ } while (b);
- // Blocking check evasions are possible only if the checking piece is
- // a slider
- if (checkers & pos.sliders())
- {
- Bitboard blockSquares = squares_between(checksq, ksq);
+ // Generate evasions for king, capture and non capture moves
+ b = pos.attacks_from<KING>(ksq) & ~pos.pieces_of_color(us) & ~sliderAttacks;
+ from = ksq;
+ SERIALIZE_MOVES(b);
- assert((pos.occupied_squares() & blockSquares) == EmptyBoardBB);
+ // Generate evasions for other pieces only if not double check
+ if (checkersCnt > 1)
+ return mlist;
- // Pawn moves. Because a blocking evasion can never be a capture, we
- // only generate pawn pushes.
- if (us == WHITE)
- mlist = generate_pawn_blocking_evasions<WHITE>(pos, not_pinned, blockSquares, mlist);
- else
- mlist = generate_pawn_blocking_evasions<BLACK>(pos, not_pinned, blockSquares, mlist);
+ // Find squares where a blocking evasion or a capture of the
+ // checker piece is possible.
+ target = squares_between(checksq, ksq) | checkers;
- // Pieces moves
- b1 = pos.knights(us) & not_pinned;
- if (b1)
- mlist = generate_piece_blocking_evasions<KNIGHT>(pos, b1, blockSquares, mlist);
+ mlist = generate_piece_moves<PAWN, EVASION>(pos, mlist, us, target);
+ mlist = generate_piece_moves<KNIGHT>(pos, mlist, us, target);
+ mlist = generate_piece_moves<BISHOP>(pos, mlist, us, target);
+ mlist = generate_piece_moves<ROOK>(pos, mlist, us, target);
+ return generate_piece_moves<QUEEN>(pos, mlist, us, target);
+}
- b1 = pos.bishops(us) & not_pinned;
- if (b1)
- mlist = generate_piece_blocking_evasions<BISHOP>(pos, b1, blockSquares, mlist);
- b1 = pos.rooks(us) & not_pinned;
- if (b1)
- mlist = generate_piece_blocking_evasions<ROOK>(pos, b1, blockSquares, mlist);
+/// generate_moves() computes a complete list of legal or pseudo-legal moves in
+/// the current position. This function is not very fast, and should be used
+/// only in non time-critical paths.
- b1 = pos.queens(us) & not_pinned;
- if (b1)
- mlist = generate_piece_blocking_evasions<QUEEN>(pos, b1, blockSquares, mlist);
- }
+MoveStack* generate_moves(const Position& pos, MoveStack* mlist, bool pseudoLegal) {
- // Finally, the ugly special case of en passant captures. An en passant
- // capture can only be a check evasion if the check is not a discovered
- // check. If pos.ep_square() is set, the last move made must have been
- // a double pawn push. If, furthermore, the checking piece is a pawn,
- // an en passant check evasion may be possible.
- if (pos.ep_square() != SQ_NONE && (checkers & pos.pawns(them)))
- {
- to = pos.ep_square();
- b1 = pos.pawn_attacks(them, to) & pos.pawns(us);
+ assert(pos.is_ok());
- assert(b1 != EmptyBoardBB);
+ MoveStack *last, *cur = mlist;
+ Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
- b1 &= not_pinned;
- while (b1)
- {
- from = pop_1st_bit(&b1);
-
- // Before generating the move, we have to make sure it is legal.
- // This is somewhat tricky, because the two disappearing pawns may
- // cause new "discovered checks". We test this by removing the
- // two relevant bits from the occupied squares bitboard, and using
- // the low-level bitboard functions for bishop and rook attacks.
- b2 = pos.occupied_squares();
- clear_bit(&b2, from);
- clear_bit(&b2, checksq);
- if (!( (bishop_attacks_bb(ksq, b2) & pos.bishops_and_queens(them))
- ||(rook_attacks_bb(ksq, b2) & pos.rooks_and_queens(them))))
-
- (*mlist++).move = make_ep_move(from, to);
- }
- }
- }
- return int(mlist - mlist_start);
-}
+ // Generate pseudo-legal moves
+ if (pos.is_check())
+ last = generate_evasions(pos, mlist);
+ else
+ last = generate_noncaptures(pos, generate_captures(pos, mlist));
+ if (pseudoLegal)
+ return last;
-/// generate_legal_moves() computes a complete list of legal moves in the
-/// current position. This function is not very fast, and should be used
-/// only in situations where performance is unimportant. It wouldn't be
-/// very hard to write an efficient legal move generator, but for the moment
-/// we don't need it.
+ // Remove illegal moves from the list
+ while (cur != last)
+ if (pos.pl_move_is_legal(cur->move, pinned))
+ cur++;
+ else
+ cur->move = (--last)->move;
-int generate_legal_moves(const Position& pos, MoveStack* mlist) {
+ return last;
+}
- assert(pos.is_ok());
- if (pos.is_check())
- return generate_evasions(pos, mlist);
+/// move_is_legal() takes a position and a (not necessarily pseudo-legal)
+/// move and tests whether the move is legal. This version is not very fast
+/// and should be used only in non time-critical paths.
- // Generate pseudo-legal moves
- int n = generate_captures(pos, mlist);
- n += generate_noncaptures(pos, mlist + n);
+bool move_is_legal(const Position& pos, const Move m) {
- Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
+ MoveStack mlist[256];
+ MoveStack *cur, *last = generate_moves(pos, mlist, true);
- // Remove illegal moves from the list
- for (int i = 0; i < n; i++)
- if (!pos.pl_move_is_legal(mlist[i].move, pinned))
- mlist[i--].move = mlist[--n].move;
+ for (cur = mlist; cur != last; cur++)
+ if (cur->move == m)
+ return pos.pl_move_is_legal(m, pos.pinned_pieces(pos.side_to_move()));
- return n;
+ return false;
}
-/// move_is_legal() takes a position and a (not necessarily pseudo-legal)
-/// move and a pinned pieces bitboard as input, and tests whether
-/// the move is legal. If the move is legal, the move itself is
-/// returned. If not, the function returns false. This function must
-/// only be used when the side to move is not in check.
+/// Fast version of move_is_legal() that takes a position a move and a
+/// bitboard of pinned pieces as input, and tests whether the move is legal.
bool move_is_legal(const Position& pos, const Move m, Bitboard pinned) {
assert(pos.is_ok());
- assert(!pos.is_check());
assert(move_is_ok(m));
assert(pinned == pos.pinned_pieces(pos.side_to_move()));
Color us = pos.side_to_move();
Color them = opposite_color(us);
Square from = move_from(m);
+ Square to = move_to(m);
Piece pc = pos.piece_on(from);
+ // Use a slower but simpler function for uncommon cases
+ if (move_is_ep(m) || move_is_castle(m))
+ return move_is_legal(pos, m);
+
// If the from square is not occupied by a piece belonging to the side to
// move, the move is obviously not legal.
if (color_of_piece(pc) != us)
return false;
- Square to = move_to(m);
-
- // En passant moves
- if (move_is_ep(m))
- {
- // The piece must be a pawn and destination square must be the
- // en passant square.
- if ( type_of_piece(pc) != PAWN
- || to != pos.ep_square())
- return false;
-
- assert(pos.square_is_empty(to));
- assert(pos.piece_on(to - pawn_push(us)) == pawn_of_color(them));
-
- // The move is pseudo-legal, check if it is also legal
- return pos.pl_move_is_legal(m, pinned);
- }
-
- // Castling moves
- if (move_is_short_castle(m))
- {
- // The piece must be a king and side to move must still have
- // the right to castle kingside.
- if ( type_of_piece(pc) != KING
- ||!pos.can_castle_kingside(us))
- return false;
-
- assert(from == pos.king_square(us));
- assert(to == pos.initial_kr_square(us));
- assert(pos.piece_on(to) == rook_of_color(us));
-
- Square g1 = relative_square(us, SQ_G1);
- Square f1 = relative_square(us, SQ_F1);
- Square s;
- bool illegal = false;
-
- // Check if any of the squares between king and rook
- // is occupied or under attack.
- for (s = Min(from, g1); s <= Max(from, g1); s++)
- if ( (s != from && s != to && !pos.square_is_empty(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
-
- // Check if any of the squares between king and rook
- // is occupied.
- for (s = Min(to, f1); s <= Max(to, f1); s++)
- if (s != from && s != to && !pos.square_is_empty(s))
- illegal = true;
-
- return !illegal;
- }
-
- if (move_is_long_castle(m))
- {
- // The piece must be a king and side to move must still have
- // the right to castle kingside.
- if ( type_of_piece(pc) != KING
- ||!pos.can_castle_queenside(us))
- return false;
-
- assert(from == pos.king_square(us));
- assert(to == pos.initial_qr_square(us));
- assert(pos.piece_on(to) == rook_of_color(us));
-
- Square c1 = relative_square(us, SQ_C1);
- Square d1 = relative_square(us, SQ_D1);
- Square s;
- bool illegal = false;
-
- for (s = Min(from, c1); s <= Max(from, c1); s++)
- if( (s != from && s != to && !pos.square_is_empty(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
-
- for (s = Min(to, d1); s <= Max(to, d1); s++)
- if(s != from && s != to && !pos.square_is_empty(s))
- illegal = true;
-
- if ( square_file(to) == FILE_B
- && ( pos.piece_on(to + DELTA_W) == rook_of_color(them)
- || pos.piece_on(to + DELTA_W) == queen_of_color(them)))
- illegal = true;
-
- return !illegal;
- }
-
- // Normal moves
-
// The destination square cannot be occupied by a friendly piece
if (pos.color_of_piece_on(to) == us)
return false;
- // Proceed according to the type of the moving piece.
+ // Handle the special case of a pawn move
if (type_of_piece(pc) == PAWN)
{
- // If the destination square is on the 8/1th rank, the move must
- // be a promotion.
- if ( ( (square_rank(to) == RANK_8 && us == WHITE)
- ||(square_rank(to) == RANK_1 && us != WHITE))
- && !move_promotion(m))
+ // Move direction must be compatible with pawn color
+ int direction = to - from;
+ if ((us == WHITE) != (direction > 0))
+ return false;
+
+ // A pawn move is a promotion iff the destination square is
+ // on the 8/1th rank.
+ if (( (square_rank(to) == RANK_8 && us == WHITE)
+ ||(square_rank(to) == RANK_1 && us != WHITE)) != bool(move_is_promotion(m)))
return false;
- // Proceed according to the square delta between the source and
- // destionation squares.
- switch (to - from)
+ // Proceed according to the square delta between the origin and
+ // destination squares.
+ switch (direction)
{
case DELTA_NW:
case DELTA_NE:
return false;
}
// The move is pseudo-legal, check if it is also legal
- return pos.pl_move_is_legal(m, pinned);
+ return pos.is_check() ? pos.pl_move_is_evasion(m, pinned) : pos.pl_move_is_legal(m, pinned);
}
// Luckly we can handle all the other pieces in one go
- return ( pos.piece_attacks_square(from, to)
- && pos.pl_move_is_legal(m, pinned)
- && !move_promotion(m));
+ return bit_is_set(pos.attacks_from(pc, from), to)
+ && (pos.is_check() ? pos.pl_move_is_evasion(m, pinned) : pos.pl_move_is_legal(m, pinned))
+ && !move_is_promotion(m);
}
template<PieceType Piece>
MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
- Square from;
Bitboard b;
+ Square from;
+ const Square* ptr = pos.piece_list_begin(us, Piece);
- for (int i = 0, e = pos.piece_count(us, Piece); i < e; i++)
+ while ((from = *ptr++) != SQ_NONE)
{
- from = pos.piece_list(us, Piece, i);
- b = pos.piece_attacks<Piece>(from) & target;
+ b = pos.attacks_from<Piece>(from) & target;
SERIALIZE_MOVES(b);
}
return mlist;
Bitboard b;
Square from = pos.king_square(us);
- b = pos.piece_attacks<KING>(from) & target;
+ b = pos.attacks_from<KING>(from) & target;
SERIALIZE_MOVES(b);
return mlist;
}
- template<PieceType Piece>
- MoveStack* generate_piece_blocking_evasions(const Position& pos, Bitboard b,
- Bitboard blockSquares, MoveStack* mlist) {
- while (b)
- {
- Square from = pop_1st_bit(&b);
- Bitboard bb = pos.piece_attacks<Piece>(from) & blockSquares;
- SERIALIZE_MOVES(bb);
- }
- return mlist;
+ template<Color Us, SquareDelta Direction>
+ inline Bitboard move_pawns(Bitboard p) {
+
+ if (Direction == DELTA_N)
+ return Us == WHITE ? p << 8 : p >> 8;
+ else if (Direction == DELTA_NE)
+ return Us == WHITE ? p << 9 : p >> 7;
+ else if (Direction == DELTA_NW)
+ return Us == WHITE ? p << 7 : p >> 9;
+ else
+ return p;
}
+ template<Color Us, MoveType Type, SquareDelta Diagonal>
+ inline MoveStack* generate_pawn_captures(MoveStack* mlist, Bitboard pawns, Bitboard enemyPieces) {
- template<Color Us, Color Them, Bitboard TRank8BB, SquareDelta TDELTA_NE,
- SquareDelta TDELTA_NW, SquareDelta TDELTA_N
- >
- MoveStack* do_generate_pawn_captures(const Position& pos, MoveStack* mlist) {
+ // Calculate our parametrized parameters at compile time
+ const Bitboard TRank8BB = (Us == WHITE ? Rank8BB : Rank1BB);
+ const Bitboard TFileABB = (Diagonal == DELTA_NE ? FileABB : FileHBB);
+ const SquareDelta TDELTA_NE = (Us == WHITE ? DELTA_NE : DELTA_SE);
+ const SquareDelta TDELTA_NW = (Us == WHITE ? DELTA_NW : DELTA_SW);
+ const SquareDelta TTDELTA_NE = (Diagonal == DELTA_NE ? TDELTA_NE : TDELTA_NW);
+ Bitboard b1, b2;
Square to;
- Bitboard pawns = pos.pawns(Us);
- Bitboard enemyPieces = pos.pieces_of_color(Them);
- // Captures in the a1-h8 (a8-h1 for black) direction
- Bitboard b1 = (Us == WHITE ? pawns << 9 : pawns >> 7) & ~FileABB & enemyPieces;
+ // Captures in the a1-h8 (a8-h1 for black) diagonal or in the h1-a8 (h8-a1 for black)
+ b1 = move_pawns<Us, Diagonal>(pawns) & ~TFileABB & enemyPieces;
- // Capturing promotions
- Bitboard b2 = b1 & TRank8BB;
- while (b2)
+ // Capturing promotions and under-promotions
+ if (b1 & TRank8BB)
{
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_promotion_move(to - TDELTA_NE, to, QUEEN);
+ b2 = b1 & TRank8BB;
+ b1 &= ~TRank8BB;
+ while (b2)
+ {
+ to = pop_1st_bit(&b2);
+
+ if (Type == CAPTURE || Type == EVASION)
+ (*mlist++).move = make_promotion_move(to - TTDELTA_NE, to, QUEEN);
+
+ if (Type == NON_CAPTURE || Type == EVASION)
+ {
+ (*mlist++).move = make_promotion_move(to - TTDELTA_NE, to, ROOK);
+ (*mlist++).move = make_promotion_move(to - TTDELTA_NE, to, BISHOP);
+ (*mlist++).move = make_promotion_move(to - TTDELTA_NE, to, KNIGHT);
+ }
+
+ // This is the only possible under promotion that can give a check
+ // not already included in the queen-promotion. It is not sure that
+ // the promoted knight will give check, but it doesn't worth to verify.
+ if (Type == CHECK)
+ (*mlist++).move = make_promotion_move(to - TTDELTA_NE, to, KNIGHT);
+ }
}
- // Capturing non-promotions
- b2 = b1 & ~TRank8BB;
- while (b2)
- {
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_move(to - TDELTA_NE, to);
- }
+ // Serialize standard captures
+ if (Type == CAPTURE || Type == EVASION)
+ SERIALIZE_MOVES_D(b1, -TTDELTA_NE);
- // Captures in the h1-a8 (h8-a1 for black) direction
- b1 = (Us == WHITE ? pawns << 7 : pawns >> 9) & ~FileHBB & enemyPieces;
+ return mlist;
+ }
- // Capturing promotions
- b2 = b1 & TRank8BB;
- while (b2)
- {
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_promotion_move(to - TDELTA_NW, to, QUEEN);
- }
+ template<Color Us, MoveType Type>
+ MoveStack* generate_pawn_moves(const Position& pos, MoveStack* mlist, Bitboard target, Square ksq) {
- // Capturing non-promotions
- b2 = b1 & ~TRank8BB;
- while (b2)
- {
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_move(to - TDELTA_NW, to);
- }
+ // Calculate our parametrized parameters at compile time
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Bitboard TRank8BB = (Us == WHITE ? Rank8BB : Rank1BB);
+ const Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+ const Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
+ const SquareDelta TDELTA_N = (Us == WHITE ? DELTA_N : DELTA_S);
+
+ Square to;
+ Bitboard b1, b2, enemyPieces, emptySquares;
+ Bitboard pawns = pos.pieces(PAWN, Us);
- // Non-capturing promotions
- b1 = (Us == WHITE ? pawns << 8 : pawns >> 8) & pos.empty_squares() & TRank8BB;
- while (b1)
+ // Standard captures and capturing promotions and underpromotions
+ if (Type == CAPTURE || Type == EVASION || (pawns & TRank7BB))
{
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, QUEEN);
+ enemyPieces = (Type == CAPTURE ? target : pos.pieces_of_color(opposite_color(Us)));
+
+ if (Type == EVASION)
+ enemyPieces &= target; // Capture only the checker piece
+
+ mlist = generate_pawn_captures<Us, Type, DELTA_NE>(mlist, pawns, enemyPieces);
+ mlist = generate_pawn_captures<Us, Type, DELTA_NW>(mlist, pawns, enemyPieces);
}
- // En passant captures
- if (pos.ep_square() != SQ_NONE)
+ // Non-capturing promotions and underpromotions
+ if (pawns & TRank7BB)
{
- assert(Us != WHITE || square_rank(pos.ep_square()) == RANK_6);
- assert(Us != BLACK || square_rank(pos.ep_square()) == RANK_3);
+ b1 = move_pawns<Us, DELTA_N>(pawns) & TRank8BB & pos.empty_squares();
- b1 = pawns & pos.pawn_attacks(Them, pos.ep_square());
- assert(b1 != EmptyBoardBB);
+ if (Type == EVASION)
+ b1 &= target; // Only blocking promotion pushes
while (b1)
{
to = pop_1st_bit(&b1);
- (*mlist++).move = make_ep_move(to, pos.ep_square());
- }
- }
- return mlist;
- }
-
- template<Color Us, Color Them, Bitboard TRank8BB, Bitboard TRank3BB,
- SquareDelta TDELTA_NE, SquareDelta TDELTA_NW, SquareDelta TDELTA_N
- >
- MoveStack* do_generate_pawn_noncaptures(const Position& pos, MoveStack* mlist) {
-
- Bitboard pawns = pos.pawns(Us);
- Bitboard enemyPieces = pos.pieces_of_color(Them);
- Bitboard emptySquares = pos.empty_squares();
- Bitboard b1, b2;
- Square to;
- // Underpromotion captures in the a1-h8 (a8-h1 for black) direction
- b1 = (Us == WHITE ? pawns << 9 : pawns >> 7) & ~FileABB & enemyPieces & TRank8BB;
- while (b1)
- {
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_promotion_move(to - TDELTA_NE, to, ROOK);
- (*mlist++).move = make_promotion_move(to - TDELTA_NE, to, BISHOP);
- (*mlist++).move = make_promotion_move(to - TDELTA_NE, to, KNIGHT);
- }
+ if (Type == CAPTURE || Type == EVASION)
+ (*mlist++).move = make_promotion_move(to - TDELTA_N, to, QUEEN);
- // Underpromotion captures in the h1-a8 (h8-a1 for black) direction
- b1 = (Us == WHITE ? pawns << 7 : pawns >> 9) & ~FileHBB & enemyPieces & TRank8BB;
- while (b1)
- {
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_promotion_move(to - TDELTA_NW, to, ROOK);
- (*mlist++).move = make_promotion_move(to - TDELTA_NW, to, BISHOP);
- (*mlist++).move = make_promotion_move(to - TDELTA_NW, to, KNIGHT);
- }
+ if (Type == NON_CAPTURE || Type == EVASION)
+ {
+ (*mlist++).move = make_promotion_move(to - TDELTA_N, to, ROOK);
+ (*mlist++).move = make_promotion_move(to - TDELTA_N, to, BISHOP);
+ (*mlist++).move = make_promotion_move(to - TDELTA_N, to, KNIGHT);
+ }
- // Single pawn pushes
- b1 = (Us == WHITE ? pawns << 8 : pawns >> 8) & emptySquares;
- b2 = b1 & TRank8BB;
- while (b2)
- {
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, ROOK);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, BISHOP);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, KNIGHT);
- }
- b2 = b1 & ~TRank8BB;
- while (b2)
- {
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_move(to - TDELTA_N, to);
+ // This is the only possible under promotion that can give a check
+ // not already included in the queen-promotion.
+ if (Type == CHECK && bit_is_set(pos.attacks_from<KNIGHT>(to), pos.king_square(Them)))
+ (*mlist++).move = make_promotion_move(to - TDELTA_N, to, KNIGHT);
+ }
}
- // Double pawn pushes
- b2 = (Us == WHITE ? (b1 & TRank3BB) << 8 : (b1 & TRank3BB) >> 8) & emptySquares;
- while (b2)
+ // Standard pawn pushes and double pushes
+ if (Type != CAPTURE)
{
- to = pop_1st_bit(&b2);
- (*mlist++).move = make_move(to - TDELTA_N - TDELTA_N, to);
- }
- return mlist;
- }
-
+ emptySquares = (Type == NON_CAPTURE ? target : pos.empty_squares());
- template<Color Us, Color Them, Bitboard TRank8BB, Bitboard TRank3BB, SquareDelta TDELTA_N>
- MoveStack* do_generate_pawn_checks(const Position& pos, Bitboard dc, Square ksq, MoveStack* mlist)
- {
- // Pawn moves which give discovered check. This is possible only if the
- // pawn is not on the same file as the enemy king, because we don't
- // generate captures.
- Bitboard empty = pos.empty_squares();
+ // Single and double pawn pushes
+ b1 = move_pawns<Us, DELTA_N>(pawns) & emptySquares & ~TRank8BB;
+ b2 = move_pawns<Us, DELTA_N>(b1 & TRank3BB) & emptySquares;
- // Find all friendly pawns not on the enemy king's file
- Bitboard b1 = pos.pawns(Us) & ~file_bb(ksq), b2, b3;
-
- // Discovered checks, single pawn pushes, no promotions
- b2 = b3 = (Us == WHITE ? (b1 & dc) << 8 : (b1 & dc) >> 8) & empty & ~TRank8BB;
- while (b3)
- {
- Square to = pop_1st_bit(&b3);
- (*mlist++).move = make_move(to - TDELTA_N, to);
+ // Filter out unwanted pushes according to the move type
+ if (Type == EVASION)
+ {
+ b1 &= target;
+ b2 &= target;
+ }
+ else if (Type == CHECK)
+ {
+ // Pawn moves which give direct cheks
+ b1 &= pos.attacks_from<PAWN>(ksq, Them);
+ b2 &= pos.attacks_from<PAWN>(ksq, Them);
+
+ // Pawn moves which gives discovered check. This is possible only if
+ // the pawn is not on the same file as the enemy king, because we
+ // don't generate captures.
+ if (pawns & target) // For CHECK type target is dc bitboard
+ {
+ Bitboard dc1 = move_pawns<Us, DELTA_N>(pawns & target & ~file_bb(ksq)) & emptySquares & ~TRank8BB;
+ Bitboard dc2 = move_pawns<Us, DELTA_N>(dc1 & TRank3BB) & emptySquares;
+
+ b1 |= dc1;
+ b2 |= dc2;
+ }
+ }
+ SERIALIZE_MOVES_D(b1, -TDELTA_N);
+ SERIALIZE_MOVES_D(b2, -TDELTA_N -TDELTA_N);
}
- // Discovered checks, double pawn pushes
- b3 = (Us == WHITE ? (b2 & TRank3BB) << 8 : (b2 & TRank3BB) >> 8) & empty;
- while (b3)
+ // En passant captures
+ if ((Type == CAPTURE || Type == EVASION) && pos.ep_square() != SQ_NONE)
{
- Square to = pop_1st_bit(&b3);
- (*mlist++).move = make_move(to - TDELTA_N - TDELTA_N, to);
- }
+ assert(Us != WHITE || square_rank(pos.ep_square()) == RANK_6);
+ assert(Us != BLACK || square_rank(pos.ep_square()) == RANK_3);
- // Direct checks. These are possible only for pawns on neighboring files
- // of the enemy king
- b1 &= (~dc & neighboring_files_bb(ksq));
+ // An en passant capture can be an evasion only if the checking piece
+ // is the double pushed pawn and so is in the target. Otherwise this
+ // is a discovery check and we are forced to do otherwise.
+ if (Type == EVASION && !bit_is_set(target, pos.ep_square() - TDELTA_N))
+ return mlist;
- // Direct checks, single pawn pushes
- b2 = (Us == WHITE ? b1 << 8 : b1 >> 8) & empty;
- b3 = b2 & pos.pawn_attacks(Them, ksq);
- while (b3)
- {
- Square to = pop_1st_bit(&b3);
- (*mlist++).move = make_move(to - TDELTA_N, to);
- }
+ b1 = pawns & pos.attacks_from<PAWN>(pos.ep_square(), Them);
- // Direct checks, double pawn pushes
- b3 = (Us == WHITE ? (b2 & TRank3BB) << 8 : (b2 & TRank3BB) >> 8)
- & empty
- & pos.pawn_attacks(Them, ksq);
+ assert(b1 != EmptyBoardBB);
- while (b3)
- {
- Square to = pop_1st_bit(&b3);
- (*mlist++).move = make_move(to - TDELTA_N - TDELTA_N, to);
+ while (b1)
+ {
+ to = pop_1st_bit(&b1);
+ (*mlist++).move = make_ep_move(to, pos.ep_square());
+ }
}
return mlist;
}
template<PieceType Piece>
- MoveStack* generate_piece_checks(const Position& pos, Bitboard target, Bitboard dc,
- Square ksq, MoveStack* mlist) {
- // Discovered checks
- Bitboard b = target & dc;
- while (b)
- {
- Square from = pop_1st_bit(&b);
- Bitboard bb = pos.piece_attacks<Piece>(from) & pos.empty_squares();
- SERIALIZE_MOVES(bb);
- }
- // Direct checks
- b = target & ~dc;
- Bitboard checkSqs = pos.piece_attacks<Piece>(ksq) & pos.empty_squares();
- while (b)
- {
- Square from = pop_1st_bit(&b);
- Bitboard bb = pos.piece_attacks<Piece>(from) & checkSqs;
- SERIALIZE_MOVES(bb);
- }
- return mlist;
- }
+ MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from) {
- MoveStack* generate_piece_checks_king(const Position& pos, Square from, Bitboard dc,
- Square ksq, MoveStack* mlist) {
- if (bit_is_set(dc, from))
+ assert(Piece != QUEEN);
+
+ Bitboard b = pos.attacks_from<Piece>(from) & pos.empty_squares();
+ if (Piece == KING)
{
- Bitboard b = pos.piece_attacks<KING>(from)
- & pos.empty_squares()
- & ~QueenPseudoAttacks[ksq];
- SERIALIZE_MOVES(b);
+ Square ksq = pos.king_square(opposite_color(pos.side_to_move()));
+ b &= ~QueenPseudoAttacks[ksq];
}
+ SERIALIZE_MOVES(b);
return mlist;
}
+ template<PieceType Piece>
+ MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us,
+ Bitboard dc, Square ksq) {
+ assert(Piece != KING);
- template<Color Us, Rank TRANK_8, Bitboard TRank3BB, SquareDelta TDELTA_N>
- MoveStack* do_generate_pawn_blocking_evasions(const Position& pos, Bitboard not_pinned,
- Bitboard blockSquares, MoveStack* mlist) {
- Square to;
+ Bitboard checkSqs, b;
+ Square from;
+ const Square* ptr = pos.piece_list_begin(us, Piece);
- // Find non-pinned pawns
- Bitboard b1 = pos.pawns(Us) & not_pinned;
+ if ((from = *ptr++) == SQ_NONE)
+ return mlist;
- // Single pawn pushes. We don't have to AND with empty squares here,
- // because the blocking squares will always be empty.
- Bitboard b2 = (Us == WHITE ? b1 << 8 : b1 >> 8) & blockSquares;
- while (b2)
- {
- to = pop_1st_bit(&b2);
+ checkSqs = pos.attacks_from<Piece>(ksq) & pos.empty_squares();
- assert(pos.piece_on(to) == EMPTY);
+ do
+ {
+ if ( (Piece == QUEEN && !(QueenPseudoAttacks[from] & checkSqs))
+ || (Piece == ROOK && !(RookPseudoAttacks[from] & checkSqs))
+ || (Piece == BISHOP && !(BishopPseudoAttacks[from] & checkSqs)))
+ continue;
- if (square_rank(to) == TRANK_8)
- {
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, QUEEN);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, ROOK);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, BISHOP);
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, KNIGHT);
- } else
- (*mlist++).move = make_move(to - TDELTA_N, to);
- }
+ if (dc && bit_is_set(dc, from))
+ continue;
- // Double pawn pushes
- b2 = (Us == WHITE ? b1 << 8 : b1 >> 8) & pos.empty_squares() & TRank3BB;
- b2 = (Us == WHITE ? b2 << 8 : b2 >> 8) & blockSquares;;
- while (b2)
- {
- to = pop_1st_bit(&b2);
+ b = pos.attacks_from<Piece>(from) & checkSqs;
+ SERIALIZE_MOVES(b);
- assert(pos.piece_on(to) == EMPTY);
- assert(Us != WHITE || square_rank(to) == RANK_4);
- assert(Us != BLACK || square_rank(to) == RANK_5);
+ } while ((from = *ptr++) != SQ_NONE);
- (*mlist++).move = make_move(to - TDELTA_N - TDELTA_N, to);
- }
return mlist;
}
Color them = opposite_color(us);
Square ksq = pos.king_square(us);
- assert(pos.piece_on(ksq) == king_of_color(us));
+ assert(pos.piece_on(ksq) == piece_of_color_and_type(us, KING));
Square rsq = (Side == KING_SIDE ? pos.initial_kr_square(us) : pos.initial_qr_square(us));
Square s1 = relative_square(us, Side == KING_SIDE ? SQ_G1 : SQ_C1);
Square s;
bool illegal = false;
- assert(pos.piece_on(rsq) == rook_of_color(us));
+ assert(pos.piece_on(rsq) == piece_of_color_and_type(us, ROOK));
// It is a bit complicated to correctly handle Chess960
for (s = Min(ksq, s1); s <= Max(ksq, s1); s++)
if ( (s != ksq && s != rsq && pos.square_is_occupied(s))
- || pos.square_is_attacked(s, them))
+ ||(pos.attackers_to(s) & pos.pieces_of_color(them)))
illegal = true;
for (s = Min(rsq, s2); s <= Max(rsq, s2); s++)
if ( Side == QUEEN_SIDE
&& square_file(rsq) == FILE_B
- && ( pos.piece_on(relative_square(us, SQ_A1)) == rook_of_color(them)
- || pos.piece_on(relative_square(us, SQ_A1)) == queen_of_color(them)))
+ && ( pos.piece_on(relative_square(us, SQ_A1)) == piece_of_color_and_type(them, ROOK)
+ || pos.piece_on(relative_square(us, SQ_A1)) == piece_of_color_and_type(them, QUEEN)))
illegal = true;
if (!illegal)
}
return mlist;
}
-
- bool castling_is_check(const Position& pos, CastlingSide side) {
-
- // After castling opponent king is attacked by the castled rook?
- File rookFile = (side == QUEEN_SIDE ? FILE_D : FILE_F);
- Color us = pos.side_to_move();
- Square ksq = pos.king_square(us);
- Bitboard occ = pos.occupied_squares(), oppKingBB = EmptyBoardBB;
-
- set_bit(&oppKingBB, pos.king_square(opposite_color(us)));
- clear_bit(&occ, ksq); // Remove our king from the board
- Square rsq = make_square(rookFile, square_rank(ksq));
- return (rook_attacks_bb(rsq, occ) & oppKingBB);
- }
}
projects / stockfish / blobdiff