X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fmovegen.cpp;h=64c6ac50135d83ea121d1b950c315578cb629ef3;hb=ccd5ccbcdbfd7bc1521fe194a970ab1c6a4b55fe;hp=a2e9c9c96578b850d9c7484be0c57d6d4b64219b;hpb=8be2c483a1d71865cda6f737d72fa11b64f73dd5;p=stockfish
diff --git a/src/movegen.cpp b/src/movegen.cpp
index a2e9c9c9..64c6ac50 100644
--- a/src/movegen.cpp
+++ b/src/movegen.cpp
@@ -1,1188 +1,542 @@
/*
- Glaurung, a UCI chess playing engine.
- Copyright (C) 2004-2008 Tord Romstad
+ Stockfish, a UCI chess playing engine derived from Glaurung 2.1
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
- Glaurung is free software: you can redistribute it and/or modify
+ Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
-
- Glaurung is distributed in the hope that it will be useful,
+
+ Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
-
+
You should have received a copy of the GNU General Public License
along with this program. If not, see .
*/
-
-////
-//// Includes
-////
-
#include
+#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))
-////
-//// Local definitions
-////
+// 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); }
namespace {
-
- int generate_white_pawn_captures(const Position&, MoveStack*);
- int generate_black_pawn_captures(const Position&, MoveStack*);
- int generate_white_pawn_noncaptures(const Position&, MoveStack*);
- int generate_black_pawn_noncaptures(const Position&, MoveStack*);
- int generate_knight_moves(const Position&, MoveStack*, Color side, Bitboard t);
- int generate_bishop_moves(const Position&, MoveStack*, Color side, Bitboard t);
- int generate_rook_moves(const Position&, MoveStack*, Color side, Bitboard t);
- int generate_queen_moves(const Position&, MoveStack*, Color side, Bitboard t);
- int generate_king_moves(const Position&, MoveStack*, Square from, Bitboard t);
- int generate_castle_moves(const Position&, MoveStack*, Color us);
-
-}
-
-
-////
-//// Functions
-////
-
-
-/// generate_captures generates() all pseudo-legal captures and queen
-/// promotions. The return value is the number of moves generated.
-
-int 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));
- int n;
-
- if (us == WHITE)
- n = generate_white_pawn_captures(pos, mlist);
- else
- n = generate_black_pawn_captures(pos, mlist);
-
- n += generate_knight_moves(pos, mlist+n, us, target);
- n += generate_bishop_moves(pos, mlist+n, us, target);
- n += generate_rook_moves(pos, mlist+n, us, target);
- n += generate_queen_moves(pos, mlist+n, us, target);
- n += generate_king_moves(pos, mlist+n, pos.king_square(us), target);
- return n;
-}
-
-
-/// generate_noncaptures() generates all pseudo-legal non-captures and
-/// underpromotions. The return value is the number of moves generated.
-
-int generate_noncaptures(const Position& pos, MoveStack *mlist) {
+ enum CastlingSide {
+ KING_SIDE,
+ QUEEN_SIDE
+ };
- assert(pos.is_ok());
- assert(!pos.is_check());
-
- Color us = pos.side_to_move();
- Bitboard target = pos.empty_squares();
- int n;
-
- if (us == WHITE)
- n = generate_white_pawn_noncaptures(pos, mlist);
- else
- n = generate_black_pawn_noncaptures(pos, mlist);
-
- n += generate_knight_moves(pos, mlist+n, us, target);
- n += generate_bishop_moves(pos, mlist+n, us, target);
- n += generate_rook_moves(pos, mlist+n, us, target);
- n += generate_queen_moves(pos, mlist+n, us, target);
- n += generate_king_moves(pos, mlist+n, pos.king_square(us), target);
- n += generate_castle_moves(pos, mlist+n, us);
- return n;
-}
+ template
+ MoveStack* generate_castle_moves(const Position&, MoveStack*, Color us);
+ template
+ MoveStack* generate_pawn_moves(const Position&, MoveStack*, Bitboard, Square);
-/// generate_checks() generates all pseudo-legal non-capturing, non-promoting
-/// checks, except castling moves (will add this later). It returns the
-/// number of generated moves.
+ template
+ inline MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from) {
-int generate_checks(const Position& pos, MoveStack* mlist, Bitboard dc) {
+ assert(Pt != QUEEN);
- assert(pos.is_ok());
- assert(!pos.is_check());
-
- Color us, them;
- Square ksq, from, to;
- Bitboard empty, checkSqs, b1, b2, b3;
- int n = 0;
+ Bitboard b = pos.attacks_from(from) & pos.empty_squares();
+ if (Pt == KING)
+ {
+ Square ksq = pos.king_square(opposite_color(pos.side_to_move()));
+ b &= ~QueenPseudoAttacks[ksq];
+ }
+ SERIALIZE_MOVES(b);
+ return mlist;
+ }
- us = pos.side_to_move();
- them = opposite_color(us);
+ template
+ inline MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us,
+ Bitboard dc, Square ksq) {
+ assert(Pt != KING);
- ksq = pos.king_square(them);
- assert(pos.piece_on(ksq) == king_of_color(them));
+ Bitboard checkSqs, b;
+ Square from;
+ const Square* ptr = pos.piece_list_begin(us, Pt);
- dc = pos.discovered_check_candidates(us);
- empty = pos.empty_squares();
-
- // Pawn moves. This is somewhat messy, and we use separate code for white
- // and black, because we can't shift by negative numbers in C/C++. :-(
+ if ((from = *ptr++) == SQ_NONE)
+ return mlist;
- if (us == WHITE)
- {
- // 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.
-
- // Find all friendly pawns not on the enemy king's file:
- b1 = pos.pawns(us) & ~file_bb(ksq);
-
- // Discovered checks, single pawn pushes:
- b2 = b3 = ((b1 & dc) << 8) & ~Rank8BB & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_N, to);
- }
+ checkSqs = pos.attacks_from(ksq) & pos.empty_squares();
- // Discovered checks, double pawn pushes:
- b3 = ((b2 & Rank3BB) << 8) & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_N - DELTA_N, to);
- }
+ do
+ {
+ if ( (Pt == QUEEN && !(QueenPseudoAttacks[from] & checkSqs))
+ || (Pt == ROOK && !(RookPseudoAttacks[from] & checkSqs))
+ || (Pt == BISHOP && !(BishopPseudoAttacks[from] & checkSqs)))
+ continue;
- // Direct checks. These are possible only for pawns on neighboring files
- // of the enemy king:
+ if (dc && bit_is_set(dc, from))
+ continue;
- b1 &= (~dc & neighboring_files_bb(ksq));
+ b = pos.attacks_from(from) & checkSqs;
+ SERIALIZE_MOVES(b);
- // Direct checks, single pawn pushes:
- b2 = (b1 << 8) & empty;
- b3 = b2 & pos.black_pawn_attacks(ksq);
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_N, to);
- }
+ } while ((from = *ptr++) != SQ_NONE);
- // Direct checks, double pawn pushes:
- b3 = ((b2 & Rank3BB) << 8) & empty & pos.black_pawn_attacks(ksq);
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_N - DELTA_N, to);
- }
+ return mlist;
}
- else { // (us == BLACK)
-
- // 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.
- // Find all friendly pawns not on the enemy king's file:
- b1 = pos.pawns(us) & ~file_bb(ksq);
+ template<>
+ FORCE_INLINE MoveStack* generate_direct_checks(const Position& p, MoveStack* m, Color us, Bitboard dc, Square ksq) {
- // Discovered checks, single pawn pushes:
- b2 = b3 = ((b1 & dc) >> 8) & ~Rank1BB & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_S, to);
- }
-
- // Discovered checks, double pawn pushes:
- b3 = ((b2 & Rank6BB) >> 8) & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_S - DELTA_S, to);
- }
-
- // Direct checks. These are possible only for pawns on neighboring files
- // of the enemy king:
+ return (us == WHITE ? generate_pawn_moves(p, m, dc, ksq)
+ : generate_pawn_moves(p, m, dc, ksq));
+ }
- b1 &= (~dc & neighboring_files_bb(ksq));
+ template
+ FORCE_INLINE MoveStack* generate_piece_moves(const Position& p, MoveStack* m, Color us, Bitboard t) {
- // Direct checks, single pawn pushes:
- b2 = (b1 >> 8) & empty;
- b3 = b2 & pos.white_pawn_attacks(ksq);
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_S, to);
- }
+ assert(Pt == PAWN);
+ assert(Type == MV_CAPTURE || Type == MV_NON_CAPTURE || Type == MV_EVASION);
- // Direct checks, double pawn pushes:
- b3 = ((b2 & Rank6BB) >> 8) & empty & pos.black_pawn_attacks(ksq);
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(to - DELTA_S - DELTA_S, to);
- }
+ return (us == WHITE ? generate_pawn_moves(p, m, t, SQ_NONE)
+ : generate_pawn_moves(p, m, t, SQ_NONE));
}
- // Knight moves
- b1 = pos.knights(us);
- if(b1) {
- // Discovered knight checks:
- b2 = b1 & dc;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.knight_attacks(from) & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Direct knight checks:
- b2 = b1 & ~dc;
- checkSqs = pos.knight_attacks(ksq) & empty;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.knight_attacks(from) & checkSqs;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
- }
+ template
+ FORCE_INLINE MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
- // Bishop moves
- b1 = pos.bishops(us);
- if(b1) {
- // Discovered bishop checks:
- b2 = b1 & dc;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.bishop_attacks(from) & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Direct bishop checks:
- b2 = b1 & ~dc;
- checkSqs = pos.bishop_attacks(ksq) & empty;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.bishop_attacks(from) & checkSqs;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
+ Bitboard b;
+ Square from;
+ const Square* ptr = pos.piece_list_begin(us, Pt);
+
+ if (*ptr != SQ_NONE)
+ {
+ do {
+ from = *ptr;
+ b = pos.attacks_from(from) & target;
+ SERIALIZE_MOVES(b);
+ } while (*++ptr != SQ_NONE);
+ }
+ return mlist;
}
- // Rook moves
- b1 = pos.rooks(us);
- if(b1) {
- // Discovered rook checks:
- b2 = b1 & dc;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.rook_attacks(from) & empty;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Direct rook checks:
- b2 = b1 & ~dc;
- checkSqs = pos.rook_attacks(ksq) & empty;
- while(b2) {
- from = pop_1st_bit(&b2);
- b3 = pos.rook_attacks(from) & checkSqs;
- while(b3) {
- to = pop_1st_bit(&b3);
- mlist[n++].move = make_move(from, to);
- }
- }
- }
+ template<>
+ FORCE_INLINE MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
- // Queen moves
- b1 = pos.queens(us);
- if(b1) {
- // Discovered queen checks are impossible!
-
- // Direct queen checks:
- checkSqs = pos.queen_attacks(ksq) & empty;
- while(b1) {
- from = pop_1st_bit(&b1);
- b2 = pos.queen_attacks(from) & checkSqs;
- while(b2) {
- to = pop_1st_bit(&b2);
- mlist[n++].move = make_move(from, to);
- }
- }
- }
+ Bitboard b;
+ Square from = pos.king_square(us);
- // King moves
- from = pos.king_square(us);
- if(bit_is_set(dc, from)) {
- b1 = pos.king_attacks(from) & empty & ~QueenPseudoAttacks[ksq];
- while(b1) {
- to = pop_1st_bit(&b1);
- mlist[n++].move = make_move(from, to);
- }
+ b = pos.attacks_from(from) & target;
+ SERIALIZE_MOVES(b);
+ return mlist;
}
- // TODO: Castling moves!
-
- return n;
}
-/// 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 generates all pseudo-legal captures and queen
+/// promotions. Returns a pointer to the end of the move list.
+///
+/// generate generates all pseudo-legal non-captures and
+/// underpromotions. Returns a pointer to the end of the move list.
+///
+/// generate generates all pseudo-legal captures and
+/// non-captures. Returns a pointer to the end of the move list.
-int generate_evasions(const Position &pos, MoveStack *mlist) {
+template
+MoveStack* generate(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
- assert(pos.is_check());
-
- Color us, them;
- Bitboard checkers = pos.checkers();
- Bitboard pinned, b1, b2;
- Square ksq, from, to;
- int n = 0;
-
- us = pos.side_to_move();
- them = opposite_color(us);
-
- ksq = pos.king_square(us);
- assert(pos.piece_on(ksq) == king_of_color(us));
-
- // Generate evasions for king:
- b1 = pos.king_attacks(ksq) & ~pos.pieces_of_color(us);
- 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.pawn_attacks(us, to) & pos.pawns(them)) == EmptyBoardBB) &&
- ((pos.knight_attacks(to) & pos.knights(them)) == EmptyBoardBB) &&
- ((pos.king_attacks(to) & pos.kings(them)) == EmptyBoardBB) &&
- ((bishop_attacks_bb(to, b2) & pos.bishops_and_queens(them))
- == EmptyBoardBB) &&
- ((rook_attacks_bb(to, b2) & pos.rooks_and_queens(them)) == EmptyBoardBB))
- mlist[n++].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).
- if(!(checkers & (checkers - 1))) {
- Square checksq = first_1(checkers);
- assert(pos.color_of_piece_on(checksq) == them);
-
- // Find pinned pieces:
- pinned = pos.pinned_pieces(us);
-
- // Generate captures of the checking piece:
-
- // Pawn captures:
- b1 = pos.pawn_attacks(them, checksq) & pos.pawns(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- if(relative_rank(us, checksq) == RANK_8) {
- mlist[n++].move = make_promotion_move(from, checksq, QUEEN);
- mlist[n++].move = make_promotion_move(from, checksq, ROOK);
- mlist[n++].move = make_promotion_move(from, checksq, BISHOP);
- mlist[n++].move = make_promotion_move(from, checksq, KNIGHT);
- }
- else
- mlist[n++].move = make_move(from, checksq);
- }
+ assert(!pos.is_check());
- // Knight captures:
- b1 = pos.knight_attacks(checksq) & pos.knights(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- mlist[n++].move = make_move(from, checksq);
- }
+ Color us = pos.side_to_move();
+ Bitboard target;
- // Bishop and queen captures:
- b1 = pos.bishop_attacks(checksq) & pos.bishops_and_queens(us)
- & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- mlist[n++].move = make_move(from, checksq);
- }
+ if (Type == MV_CAPTURE || Type == MV_NON_EVASION)
+ target = pos.pieces_of_color(opposite_color(us));
+ else if (Type == MV_NON_CAPTURE)
+ target = pos.empty_squares();
+ else
+ assert(false);
- // Rook and queen captures:
- b1 = pos.rook_attacks(checksq) & pos.rooks_and_queens(us)
- & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- mlist[n++].move = make_move(from, checksq);
- }
+ if (Type == MV_NON_EVASION)
+ {
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, pos.empty_squares());
+ target |= pos.empty_squares();
+ }
+ else
+ mlist = generate_piece_moves(pos, mlist, us, target);
- // Blocking check evasions are possible only if the checking piece is
- // a slider:
- if(checkers & pos.sliders()) {
- Bitboard blockSquares = squares_between(checksq, ksq);
- assert((pos.occupied_squares() & blockSquares) == EmptyBoardBB);
-
- // Pawn moves. Because a blocking evasion can never be a capture, we
- // only generate pawn pushes. As so often, the code for pawns is a bit
- // ugly, and uses separate clauses for white and black pawns. :-(
- if(us == WHITE) {
- // Find non-pinned pawns:
- b1 = pos.pawns(WHITE) & ~pinned;
-
- // Single pawn pushes. We don't have to AND with empty squares here,
- // because the blocking squares will always be empty.
- b2 = (b1 << 8) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- assert(pos.piece_on(to) == EMPTY);
- if(square_rank(to) == RANK_8) {
- mlist[n++].move = make_promotion_move(to - DELTA_N, to, QUEEN);
- mlist[n++].move = make_promotion_move(to - DELTA_N, to, ROOK);
- mlist[n++].move = make_promotion_move(to - DELTA_N, to, BISHOP);
- mlist[n++].move = make_promotion_move(to - DELTA_N, to, KNIGHT);
- }
- else
- mlist[n++].move = make_move(to - DELTA_N, to);
- }
- // Double pawn pushes.
- b2 = (((b1 << 8) & pos.empty_squares() & Rank3BB) << 8) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- assert(pos.piece_on(to) == EMPTY);
- assert(square_rank(to) == RANK_4);
- mlist[n++].move = make_move(to - DELTA_N - DELTA_N, to);
- }
- }
- else { // (us == BLACK)
- // Find non-pinned pawns:
- b1 = pos.pawns(BLACK) & ~pinned;
-
- // Single pawn pushes. We don't have to AND with empty squares here,
- // because the blocking squares will always be empty.
- b2 = (b1 >> 8) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- assert(pos.piece_on(to) == EMPTY);
- if(square_rank(to) == RANK_1) {
- mlist[n++].move = make_promotion_move(to - DELTA_S, to, QUEEN);
- mlist[n++].move = make_promotion_move(to - DELTA_S, to, ROOK);
- mlist[n++].move = make_promotion_move(to - DELTA_S, to, BISHOP);
- mlist[n++].move = make_promotion_move(to - DELTA_S, to, KNIGHT);
- }
- else
- mlist[n++].move = make_move(to - DELTA_S, to);
- }
- // Double pawn pushes.
- b2 = (((b1 >> 8) & pos.empty_squares() & Rank6BB) >> 8) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- assert(pos.piece_on(to) == EMPTY);
- assert(square_rank(to) == RANK_5);
- mlist[n++].move = make_move(to - DELTA_S - DELTA_S, to);
- }
- }
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
- // Knight moves
- b1 = pos.knights(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- b2 = pos.knight_attacks(from) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Bishop moves
- b1 = pos.bishops(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- b2 = pos.bishop_attacks(from) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Rook moves
- b1 = pos.rooks(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- b2 = pos.rook_attacks(from) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- mlist[n++].move = make_move(from, to);
- }
- }
-
- // Queen moves
- b1 = pos.queens(us) & ~pinned;
- while(b1) {
- from = pop_1st_bit(&b1);
- b2 = pos.queen_attacks(from) & blockSquares;
- while(b2) {
- to = pop_1st_bit(&b2);
- mlist[n++].move = make_move(from, to);
- }
- }
- }
+ if (Type != MV_CAPTURE)
+ {
+ if (pos.can_castle_kingside(us))
+ mlist = generate_castle_moves(pos, mlist, us);
- // 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(b1 != EmptyBoardBB);
- b1 &= ~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))
- == EmptyBoardBB) &&
- ((rook_attacks_bb(ksq, b2) & pos.rooks_and_queens(them))
- == EmptyBoardBB))
- mlist[n++].move = make_ep_move(from, to);
- }
- }
+ if (pos.can_castle_queenside(us))
+ mlist = generate_castle_moves(pos, mlist, us);
}
- return n;
+ return mlist;
}
+// Explicit template instantiations
+template MoveStack* generate(const Position& pos, MoveStack* mlist);
+template MoveStack* generate(const Position& pos, MoveStack* mlist);
+template MoveStack* generate(const Position& pos, MoveStack* mlist);
-/// 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.
-int generate_legal_moves(const Position& pos, MoveStack* mlist) {
+/// 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.
+template<>
+MoveStack* generate(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
+ assert(!pos.is_check());
- if (pos.is_check())
- return generate_evasions(pos, mlist);
+ Bitboard b, dc;
+ Square from;
+ Color us = pos.side_to_move();
+ Square ksq = pos.king_square(opposite_color(us));
- // Generate pseudo-legal moves:
- int n = generate_captures(pos, mlist);
- n += generate_noncaptures(pos, mlist + n);
+ assert(pos.piece_on(ksq) == make_piece(opposite_color(us), KING));
- Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
+ // Discovered non-capture checks
+ b = dc = pos.discovered_check_candidates(us);
- // Remove illegal moves from the list:
- for (int i = 0; i < n; i++)
- if (!pos.move_is_legal(mlist[i].move, pinned))
- mlist[i--].move = mlist[--n].move;
+ 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(pos, mlist, from); break;
+ case BISHOP: mlist = generate_discovered_checks(pos, mlist, from); break;
+ case ROOK: mlist = generate_discovered_checks(pos, mlist, from); break;
+ case KING: mlist = generate_discovered_checks(pos, mlist, from); break;
+ default: assert(false); break;
+ }
+ }
- return n;
+ // Direct non-capture checks
+ mlist = generate_direct_checks(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks(pos, mlist, us, dc, ksq);
+ mlist = generate_direct_checks(pos, mlist, us, dc, ksq);
+ return generate_direct_checks(pos, mlist, us, dc, ksq);
}
-/// generate_move_if_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 MOVE_NONE. This function must
-/// only be used when the side to move is not in check.
-
-Move generate_move_if_legal(const Position &pos, Move m, Bitboard pinned) {
+/// 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.
+template<>
+MoveStack* generate(const Position& pos, MoveStack* mlist) {
assert(pos.is_ok());
- assert(!pos.is_check());
- assert(move_is_ok(m));
+ assert(pos.is_check());
+ Bitboard b, target;
+ Square from, checksq;
+ int checkersCnt = 0;
Color us = pos.side_to_move();
- Color them = opposite_color(us);
- Square from = move_from(m);
- Piece pc = pos.piece_on(from);
-
- // 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 MOVE_NONE;
-
- 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 MOVE_NONE;
-
- assert(pos.square_is_empty(to));
- assert(pos.piece_on(to - pawn_push(us)) == pawn_of_color(them));
-
- // The move is pseudo-legal. If it is legal, return it.
- return (pos.move_is_legal(m) ? m : MOVE_NONE);
- }
+ Square ksq = pos.king_square(us);
+ Bitboard checkers = pos.checkers();
+ Bitboard sliderAttacks = EmptyBoardBB;
- // 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 MOVE_NONE;
-
- 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 ? m : MOVE_NONE);
- }
+ assert(pos.piece_on(ksq) == make_piece(us, KING));
+ assert(checkers);
- if (move_is_long_castle(m))
+ // 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
{
- // 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 MOVE_NONE;
-
- 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 ? m : MOVE_NONE);
- }
-
- // Normal moves
+ checkersCnt++;
+ checksq = pop_1st_bit(&b);
- // The destination square cannot be occupied by a friendly piece
- if (pos.color_of_piece_on(to) == us)
- return MOVE_NONE;
+ assert(pos.color_of_piece_on(checksq) == opposite_color(us));
- // Proceed according to the type of the moving piece.
- switch (type_of_piece(pc))
- {
- case 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))
- return MOVE_NONE;
-
- // Proceed according to the square delta between the source and
- // destionation squares.
- switch (to - from)
+ switch (pos.type_of_piece_on(checksq))
{
- case DELTA_NW:
- case DELTA_NE:
- case DELTA_SW:
- case DELTA_SE:
- // Capture. The destination square must be occupied by an enemy
- // piece (en passant captures was handled earlier).
- if (pos.color_of_piece_on(to) != them)
- return MOVE_NONE;
- break;
-
- case DELTA_N:
- case DELTA_S:
- // Pawn push. The destination square must be empty.
- if (!pos.square_is_empty(to))
- return MOVE_NONE;
- break;
-
- case DELTA_NN:
- // Double white pawn push. The destination square must be on the fourth
- // rank, and both the destination square and the square between the
- // source and destination squares must be empty.
- if ( square_rank(to) != RANK_4
- || !pos.square_is_empty(to)
- || !pos.square_is_empty(from + DELTA_N))
- return MOVE_NONE;
- break;
-
- case DELTA_SS:
- // Double black pawn push. The destination square must be on the fifth
- // rank, and both the destination square and the square between the
- // source and destination squares must be empty.
- if ( square_rank(to) != RANK_5
- || !pos.square_is_empty(to)
- || !pos.square_is_empty(from + DELTA_S))
- return MOVE_NONE;
- break;
-
+ 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 (RookPseudoAttacks[checksq] & (1ULL << ksq))
+ sliderAttacks |= RookPseudoAttacks[checksq] | pos.attacks_from(checksq);
+ else
+ sliderAttacks |= BishopPseudoAttacks[checksq] | pos.attacks_from(checksq);
default:
- return MOVE_NONE;
+ break;
}
- // The move is pseudo-legal. Return it if it is legal.
- return (pos.move_is_legal(m) ? m : MOVE_NONE);
- break;
-
- case KNIGHT:
- return ( pos.knight_attacks_square(from, to)
- && pos.move_is_legal(m)
- && !move_promotion(m) ? m : MOVE_NONE);
- break;
-
- case BISHOP:
- return ( pos.bishop_attacks_square(from, to)
- && pos.move_is_legal(m)
- && !move_promotion(m) ? m : MOVE_NONE);
- break;
-
- case ROOK:
- return ( pos.rook_attacks_square(from, to)
- && pos.move_is_legal(m)
- && !move_promotion(m) ? m : MOVE_NONE);
- break;
-
- case QUEEN:
- return ( pos.queen_attacks_square(from, to)
- && pos.move_is_legal(m)
- && !move_promotion(m) ? m : MOVE_NONE);
- break;
-
- case KING:
- return ( pos.king_attacks_square(from, to)
- && pos.move_is_legal(m)
- && !move_promotion(m) ? m : MOVE_NONE);
- break;
-
- default:
- assert(false);
- }
- assert(false);
- return MOVE_NONE;
+ } while (b);
+
+ // Generate evasions for king, capture and non capture moves
+ b = pos.attacks_from(ksq) & ~pos.pieces_of_color(us) & ~sliderAttacks;
+ from = ksq;
+ SERIALIZE_MOVES(b);
+
+ // Generate evasions for other pieces only if not double check
+ if (checkersCnt > 1)
+ return mlist;
+
+ // Find squares where a blocking evasion or a capture of the
+ // checker piece is possible.
+ target = squares_between(checksq, ksq) | checkers;
+
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ mlist = generate_piece_moves(pos, mlist, us, target);
+ return generate_piece_moves(pos, mlist, us, target);
}
-namespace {
-
- int generate_white_pawn_captures(const Position &pos, MoveStack *mlist) {
- Bitboard pawns = pos.pawns(WHITE);
- Bitboard enemyPieces = pos.pieces_of_color(BLACK);
- Bitboard b1, b2;
- Square sq;
- int n = 0;
-
- // Captures in the a1-h8 direction:
- b1 = (pawns << 9) & ~FileABB & enemyPieces;
-
- // Promotions:
- b2 = b1 & Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_NE, sq, QUEEN);
- }
-
- // Non-promotions:
- b2 = b1 & ~Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_NE, sq);
- }
-
- // Captures in the h1-a8 direction:
- b1 = (pawns << 7) & ~FileHBB & enemyPieces;
-
- // Promotions:
- b2 = b1 & Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_NW, sq, QUEEN);
- }
+/// generate computes a complete list of legal
+/// or pseudo-legal moves in the current position.
+template<>
+MoveStack* generate(const Position& pos, MoveStack* mlist) {
- // Non-promotions:
- b2 = b1 & ~Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_NW, sq);
- }
-
- // Non-capturing promotions:
- b1 = (pawns << 8) & pos.empty_squares() & Rank8BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_N, sq, QUEEN);
- }
-
- // En passant captures:
- if(pos.ep_square() != SQ_NONE) {
- assert(square_rank(pos.ep_square()) == RANK_6);
- b1 = pawns & pos.black_pawn_attacks(pos.ep_square());
- assert(b1 != EmptyBoardBB);
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_ep_move(sq, pos.ep_square());
- }
- }
-
- return n;
- }
+ assert(pos.is_ok());
+ return pos.is_check() ? generate(pos, mlist)
+ : generate(pos, mlist);
+}
- int generate_black_pawn_captures(const Position &pos, MoveStack *mlist) {
- Bitboard pawns = pos.pawns(BLACK);
- Bitboard enemyPieces = pos.pieces_of_color(WHITE);
- Bitboard b1, b2;
- Square sq;
- int n = 0;
+template<>
+MoveStack* generate(const Position& pos, MoveStack* mlist) {
- // Captures in the a8-h1 direction:
- b1 = (pawns >> 7) & ~FileABB & enemyPieces;
+ assert(pos.is_ok());
- // Promotions:
- b2 = b1 & Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_SE, sq, QUEEN);
- }
+ MoveStack *last, *cur = mlist;
+ Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
- // Non-promotions:
- b2 = b1 & ~Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_SE, sq);
- }
+ last = generate(pos, mlist);
- // Captures in the h8-a1 direction:
- b1 = (pawns >> 9) & ~FileHBB & enemyPieces;
+ // Remove illegal moves from the list
+ while (cur != last)
+ if (!pos.pl_move_is_legal(cur->move, pinned))
+ cur->move = (--last)->move;
+ else
+ cur++;
- // Promotions:
- b2 = b1 & Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_SW, sq, QUEEN);
- }
+ return last;
+}
- // Non-promotions:
- b2 = b1 & ~Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_SW, sq);
- }
- // Non-capturing promotions:
- b1 = (pawns >> 8) & pos.empty_squares() & Rank1BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_S, sq, QUEEN);
- }
+namespace {
- // En passant captures:
- if(pos.ep_square() != SQ_NONE) {
- assert(square_rank(pos.ep_square()) == RANK_3);
- b1 = pawns & pos.white_pawn_attacks(pos.ep_square());
- assert(b1 != EmptyBoardBB);
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_ep_move(sq, pos.ep_square());
- }
- }
+ template
+ inline Bitboard move_pawns(Bitboard p) {
- return n;
+ return Delta == DELTA_N ? p << 8 : Delta == DELTA_S ? p >> 8 :
+ Delta == DELTA_NE ? p << 9 : Delta == DELTA_SE ? p >> 7 :
+ Delta == DELTA_NW ? p << 7 : Delta == DELTA_SW ? p >> 9 : p;
}
-
-
- int generate_white_pawn_noncaptures(const Position &pos, MoveStack *mlist) {
- Bitboard pawns = pos.pawns(WHITE);
- Bitboard enemyPieces = pos.pieces_of_color(BLACK);
- Bitboard emptySquares = pos.empty_squares();
- Bitboard b1, b2;
- Square sq;
- int n = 0;
-
- // Underpromotion captures in the a1-h8 direction:
- b1 = (pawns << 9) & ~FileABB & enemyPieces & Rank8BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_NE, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_NE, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_NE, sq, KNIGHT);
- }
- // Underpromotion captures in the h1-a8 direction:
- b1 = (pawns << 7) & ~FileHBB & enemyPieces & Rank8BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_NW, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_NW, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_NW, sq, KNIGHT);
- }
+ template
+ inline MoveStack* generate_pawn_captures(MoveStack* mlist, Bitboard pawns, Bitboard target) {
- // Single pawn pushes:
- b1 = (pawns << 8) & emptySquares;
- b2 = b1 & Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_N, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_N, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_N, sq, KNIGHT);
- }
- b2 = b1 & ~Rank8BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_N, sq);
- }
+ const Bitboard TFileABB = (Delta == DELTA_NE || Delta == DELTA_SE ? FileABB : FileHBB);
- // Double pawn pushes:
- b2 = ((b1 & Rank3BB) << 8) & emptySquares;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_N - DELTA_N, sq);
- }
+ Bitboard b;
+ Square to;
- return n;
+ // Captures in the a1-h8 (a8-h1 for black) diagonal or in the h1-a8 (h8-a1 for black)
+ b = move_pawns(pawns) & target & ~TFileABB;
+ SERIALIZE_MOVES_D(b, -Delta);
+ return mlist;
}
+ template
+ inline MoveStack* generate_promotions(const Position& pos, MoveStack* mlist, Bitboard pawnsOn7, Bitboard target) {
- int generate_black_pawn_noncaptures(const Position &pos, MoveStack *mlist) {
- Bitboard pawns = pos.pawns(BLACK);
- Bitboard enemyPieces = pos.pieces_of_color(WHITE);
- Bitboard emptySquares = pos.empty_squares();
- Bitboard b1, b2;
- Square sq;
- int n = 0;
-
- // Underpromotion captures in the a8-h1 direction:
- b1 = (pawns >> 7) & ~FileABB & enemyPieces & Rank1BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_SE, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_SE, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_SE, sq, KNIGHT);
- }
-
- // Underpromotion captures in the h8-a1 direction:
- b1 = (pawns >> 9) & ~FileHBB & enemyPieces & Rank1BB;
- while(b1) {
- sq = pop_1st_bit(&b1);
- mlist[n++].move = make_promotion_move(sq - DELTA_SW, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_SW, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_SW, sq, KNIGHT);
- }
+ const Bitboard TFileABB = (Delta == DELTA_NE || Delta == DELTA_SE ? FileABB : FileHBB);
- // Single pawn pushes:
- b1 = (pawns >> 8) & emptySquares;
- b2 = b1 & Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_promotion_move(sq - DELTA_S, sq, ROOK);
- mlist[n++].move = make_promotion_move(sq - DELTA_S, sq, BISHOP);
- mlist[n++].move = make_promotion_move(sq - DELTA_S, sq, KNIGHT);
- }
- b2 = b1 & ~Rank1BB;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_S, sq);
- }
-
- // Double pawn pushes:
- b2 = ((b1 & Rank6BB) >> 8) & emptySquares;
- while(b2) {
- sq = pop_1st_bit(&b2);
- mlist[n++].move = make_move(sq - DELTA_S - DELTA_S, sq);
- }
+ Bitboard b;
+ Square to;
- return n;
- }
+ // Promotions and under-promotions, both captures and non-captures
+ b = move_pawns(pawnsOn7) & target;
-
- int generate_knight_moves(const Position &pos, MoveStack *mlist,
- Color side, Bitboard target) {
- Square from, to;
- Bitboard b;
- int i, n = 0;
+ if (Delta != DELTA_N && Delta != DELTA_S)
+ b &= ~TFileABB;
- for(i = 0; i < pos.knight_count(side); i++) {
- from = pos.knight_list(side, i);
- b = pos.knight_attacks(from) & target;
- while(b) {
+ while (b)
+ {
to = pop_1st_bit(&b);
- mlist[n++].move = make_move(from, to);
- }
- }
- return n;
- }
+ if (Type == MV_CAPTURE || Type == MV_EVASION)
+ (*mlist++).move = make_promotion_move(to - Delta, to, QUEEN);
- int generate_bishop_moves(const Position &pos, MoveStack *mlist,
- Color side, Bitboard target) {
- Square from, to;
- Bitboard b;
- int i, n = 0;
+ if (Type == MV_NON_CAPTURE || Type == MV_EVASION)
+ {
+ (*mlist++).move = make_promotion_move(to - Delta, to, ROOK);
+ (*mlist++).move = make_promotion_move(to - Delta, to, BISHOP);
+ (*mlist++).move = make_promotion_move(to - Delta, to, KNIGHT);
+ }
- for(i = 0; i < pos.bishop_count(side); i++) {
- from = pos.bishop_list(side, i);
- b = pos.bishop_attacks(from) & target;
- while(b) {
- to = pop_1st_bit(&b);
- mlist[n++].move = make_move(from, to);
- }
+ // This is the only possible under promotion that can give a check
+ // not already included in the queen-promotion.
+ if ( Type == MV_CHECK
+ && bit_is_set(pos.attacks_from(to), pos.king_square(opposite_color(Us))))
+ (*mlist++).move = make_promotion_move(to - Delta, to, KNIGHT);
+ else (void)pos; // Silence a warning under MSVC
}
- return n;
+ return mlist;
}
+ template
+ MoveStack* generate_pawn_moves(const Position& pos, MoveStack* mlist, Bitboard target, Square ksq) {
- int generate_rook_moves(const Position &pos, MoveStack *mlist,
- Color side, Bitboard target) {
- Square from, to;
- Bitboard b;
- int i, n = 0;
+ // Calculate our parametrized parameters at compile time, named
+ // according to the point of view of white side.
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+ const Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
+ const Square TDELTA_N = (Us == WHITE ? DELTA_N : DELTA_S);
+ const Square TDELTA_NE = (Us == WHITE ? DELTA_NE : DELTA_SE);
+ const Square TDELTA_NW = (Us == WHITE ? DELTA_NW : DELTA_SW);
- for(i = 0; i < pos.rook_count(side); i++) {
- from = pos.rook_list(side, i);
- b = pos.rook_attacks(from) & target;
- while(b) {
- to = pop_1st_bit(&b);
- mlist[n++].move = make_move(from, to);
- }
+ Square to;
+ Bitboard b1, b2, dc1, dc2, pawnPushes, emptySquares;
+ Bitboard pawns = pos.pieces(PAWN, Us);
+ Bitboard pawnsOn7 = pawns & TRank7BB;
+ Bitboard enemyPieces = (Type == MV_CAPTURE ? target : pos.pieces_of_color(Them));
+
+ // Pre-calculate pawn pushes before changing emptySquares definition
+ if (Type != MV_CAPTURE)
+ {
+ emptySquares = (Type == MV_NON_CAPTURE ? target : pos.empty_squares());
+ pawnPushes = move_pawns(pawns & ~TRank7BB) & emptySquares;
+ }
+
+ if (Type == MV_EVASION)
+ {
+ emptySquares &= target; // Only blocking squares
+ enemyPieces &= target; // Capture only the checker piece
+ }
+
+ // Promotions and underpromotions
+ if (pawnsOn7)
+ {
+ if (Type == MV_CAPTURE)
+ emptySquares = pos.empty_squares();
+
+ pawns &= ~TRank7BB;
+ mlist = generate_promotions(pos, mlist, pawnsOn7, enemyPieces);
+ mlist = generate_promotions(pos, mlist, pawnsOn7, enemyPieces);
+ mlist = generate_promotions(pos, mlist, pawnsOn7, emptySquares);
+ }
+
+ // Standard captures
+ if (Type == MV_CAPTURE || Type == MV_EVASION)
+ {
+ mlist = generate_pawn_captures(mlist, pawns, enemyPieces);
+ mlist = generate_pawn_captures(mlist, pawns, enemyPieces);
+ }
+
+ // Single and double pawn pushes
+ if (Type != MV_CAPTURE)
+ {
+ b1 = pawnPushes & emptySquares;
+ b2 = move_pawns(pawnPushes & TRank3BB) & emptySquares;
+
+ if (Type == MV_CHECK)
+ {
+ // Consider only pawn moves which give direct checks
+ b1 &= pos.attacks_from(ksq, Them);
+ b2 &= pos.attacks_from(ksq, Them);
+
+ // Add 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
+ {
+ dc1 = move_pawns(pawns & target & ~file_bb(ksq)) & emptySquares;
+ dc2 = move_pawns(dc1 & TRank3BB) & emptySquares;
+
+ b1 |= dc1;
+ b2 |= dc2;
+ }
+ }
+ SERIALIZE_MOVES_D(b1, -TDELTA_N);
+ SERIALIZE_MOVES_D(b2, -TDELTA_N -TDELTA_N);
}
- return n;
- }
+ // En passant captures
+ if ((Type == MV_CAPTURE || Type == MV_EVASION) && pos.ep_square() != SQ_NONE)
+ {
+ assert(Us != WHITE || square_rank(pos.ep_square()) == RANK_6);
+ assert(Us != BLACK || square_rank(pos.ep_square()) == RANK_3);
- int generate_queen_moves(const Position &pos, MoveStack *mlist,
- Color side, Bitboard target) {
- Square from, to;
- Bitboard b;
- int i, n = 0;
+ // 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 == MV_EVASION && !bit_is_set(target, pos.ep_square() - TDELTA_N))
+ return mlist;
- for(i = 0; i < pos.queen_count(side); i++) {
- from = pos.queen_list(side, i);
- b = pos.queen_attacks(from) & target;
- while(b) {
- to = pop_1st_bit(&b);
- mlist[n++].move = make_move(from, to);
- }
- }
- return n;
- }
+ b1 = pawns & pos.attacks_from(pos.ep_square(), Them);
+ assert(b1 != EmptyBoardBB);
- int generate_king_moves(const Position &pos, MoveStack *mlist,
- Square from, Bitboard target) {
- Square to;
- Bitboard b;
- int n = 0;
-
- b = pos.king_attacks(from) & target;
- while(b) {
- to = pop_1st_bit(&b);
- mlist[n++].move = make_move(from, to);
+ while (b1)
+ {
+ to = pop_1st_bit(&b1);
+ (*mlist++).move = make_ep_move(to, pos.ep_square());
+ }
}
- return n;
+ return mlist;
}
+ template
+ MoveStack* generate_castle_moves(const Position& pos, MoveStack* mlist, Color us) {
- int generate_castle_moves(const Position &pos, MoveStack *mlist, Color us) {
- int n = 0;
+ Color them = opposite_color(us);
+ Square ksq = pos.king_square(us);
- if(pos.can_castle(us)) {
- Color them = opposite_color(us);
- Square ksq = pos.king_square(us);
- assert(pos.piece_on(ksq) == king_of_color(us));
-
- if(pos.can_castle_kingside(us)) {
- Square rsq = pos.initial_kr_square(us);
- Square g1 = relative_square(us, SQ_G1);
- Square f1 = relative_square(us, SQ_F1);
- Square s;
- bool illegal = false;
+ assert(pos.piece_on(ksq) == make_piece(us, KING));
- assert(pos.piece_on(rsq) == rook_of_color(us));
+ 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 s2 = relative_square(us, Side == KING_SIDE ? SQ_F1 : SQ_D1);
+ Square s;
+ bool illegal = false;
- for(s = Min(ksq, g1); s <= Max(ksq, g1); s++)
- if((s != ksq && s != rsq && pos.square_is_occupied(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
- for(s = Min(rsq, f1); s <= Max(rsq, f1); s++)
- if(s != ksq && s != rsq && pos.square_is_occupied(s))
+ assert(pos.piece_on(rsq) == make_piece(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.attackers_to(s) & pos.pieces_of_color(them)))
illegal = true;
- if(!illegal)
- mlist[n++].move = make_castle_move(ksq, rsq);
- }
+ for (s = Min(rsq, s2); s <= Max(rsq, s2); s++)
+ if (s != ksq && s != rsq && pos.square_is_occupied(s))
+ illegal = true;
- if(pos.can_castle_queenside(us)) {
- Square rsq = pos.initial_qr_square(us);
- Square c1 = relative_square(us, SQ_C1);
- Square d1 = relative_square(us, SQ_D1);
- Square s;
- bool illegal = false;
+ if ( Side == QUEEN_SIDE
+ && square_file(rsq) == FILE_B
+ && ( pos.piece_on(relative_square(us, SQ_A1)) == make_piece(them, ROOK)
+ || pos.piece_on(relative_square(us, SQ_A1)) == make_piece(them, QUEEN)))
+ illegal = true;
- assert(pos.piece_on(rsq) == rook_of_color(us));
+ if (!illegal)
+ (*mlist++).move = make_castle_move(ksq, rsq);
- for(s = Min(ksq, c1); s <= Max(ksq, c1); s++)
- if((s != ksq && s != rsq && pos.square_is_occupied(s))
- || pos.square_is_attacked(s, them))
- illegal = true;
- for(s = Min(rsq, d1); s <= Max(rsq, d1); s++)
- if(s != ksq && s != rsq && pos.square_is_occupied(s))
- illegal = true;
- if(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)))
- illegal = true;
-
- if(!illegal)
- mlist[n++].move = make_castle_move(ksq, rsq);
- }
- }
-
- return n;
+ return mlist;
}
-
-}
+
+} // namespace