/*
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
+ Copyright (C) 2004-2024 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
-////
-//// Includes
-////
-
-#include <cassert>
-
-#include "bitcount.h"
#include "movegen.h"
-#include "types.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))
+#include <cassert>
+#include <initializer_list>
-// 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); }
+#include "bitboard.h"
+#include "position.h"
-////
-//// Local definitions
-////
+namespace Stockfish {
namespace {
- enum CastlingSide {
- KING_SIDE,
- QUEEN_SIDE
- };
-
- template<CastlingSide Side>
- MoveStack* generate_castle_moves(const Position&, MoveStack*, Color us);
-
- template<Color Us, MoveType Type>
- MoveStack* generate_pawn_moves(const Position&, MoveStack*, Bitboard, Square);
-
- template<PieceType Piece>
- inline MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from) {
-
- assert(Piece != QUEEN);
-
- Bitboard b = pos.attacks_from<Piece>(from) & pos.empty_squares();
- if (Piece == KING)
- {
- Square ksq = pos.king_square(opposite_color(pos.side_to_move()));
- b &= ~QueenPseudoAttacks[ksq];
- }
- SERIALIZE_MOVES(b);
- return mlist;
- }
-
- template<PieceType Piece>
- inline MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us,
- Bitboard dc, Square ksq) {
- assert(Piece != KING);
-
- Bitboard checkSqs, b;
- Square from;
- const Square* ptr = pos.piece_list_begin(us, Piece);
-
- if ((from = *ptr++) == SQ_NONE)
- return mlist;
-
- checkSqs = pos.attacks_from<Piece>(ksq) & pos.empty_squares();
-
- do
- {
- if ( (Piece == QUEEN && !(QueenPseudoAttacks[from] & checkSqs))
- || (Piece == ROOK && !(RookPseudoAttacks[from] & checkSqs))
- || (Piece == BISHOP && !(BishopPseudoAttacks[from] & checkSqs)))
- continue;
-
- if (dc && bit_is_set(dc, from))
- continue;
-
- b = pos.attacks_from<Piece>(from) & checkSqs;
- SERIALIZE_MOVES(b);
-
- } while ((from = *ptr++) != SQ_NONE);
-
- return mlist;
- }
-
- template<>
- FORCE_INLINE MoveStack* generate_direct_checks<PAWN>(const Position& p, MoveStack* m, Color us, Bitboard dc, Square ksq) {
-
- return (us == WHITE ? generate_pawn_moves<WHITE, MV_CHECK>(p, m, dc, ksq)
- : generate_pawn_moves<BLACK, MV_CHECK>(p, m, dc, ksq));
- }
-
- template<PieceType Piece, MoveType Type>
- FORCE_INLINE MoveStack* generate_piece_moves(const Position& p, MoveStack* m, Color us, Bitboard t) {
-
- assert(Piece == PAWN);
- assert(Type == MV_CAPTURE || Type == MV_NON_CAPTURE || Type == MV_EVASION);
-
- return (us == WHITE ? generate_pawn_moves<WHITE, Type>(p, m, t, SQ_NONE)
- : generate_pawn_moves<BLACK, Type>(p, m, t, SQ_NONE));
- }
+template<GenType Type, Direction D, bool Enemy>
+ExtMove* make_promotions(ExtMove* moveList, [[maybe_unused]] Square to) {
- template<PieceType Piece>
- FORCE_INLINE MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
+ constexpr bool all = Type == EVASIONS || Type == NON_EVASIONS;
- Bitboard b;
- Square from;
- const Square* ptr = pos.piece_list_begin(us, Piece);
+ if constexpr (Type == CAPTURES || all)
+ *moveList++ = Move::make<PROMOTION>(to - D, to, QUEEN);
- if (*ptr != SQ_NONE)
+ if constexpr ((Type == CAPTURES && Enemy) || (Type == QUIETS && !Enemy) || all)
{
- do {
- from = *ptr;
- b = pos.attacks_from<Piece>(from) & target;
- SERIALIZE_MOVES(b);
- } while (*++ptr != SQ_NONE);
+ *moveList++ = Move::make<PROMOTION>(to - D, to, ROOK);
+ *moveList++ = Move::make<PROMOTION>(to - D, to, BISHOP);
+ *moveList++ = Move::make<PROMOTION>(to - D, to, KNIGHT);
}
- return mlist;
- }
-
- template<>
- FORCE_INLINE MoveStack* generate_piece_moves<KING>(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
-
- Bitboard b;
- Square from = pos.king_square(us);
-
- b = pos.attacks_from<KING>(from) & target;
- SERIALIZE_MOVES(b);
- return mlist;
- }
+ return moveList;
}
-////
-//// Functions
-////
-
-
-/// generate<MV_CAPTURE> generates all pseudo-legal captures and queen
-/// promotions. Returns a pointer to the end of the move list.
-///
-/// generate<MV_NON_CAPTURE> generates all pseudo-legal non-captures and
-/// underpromotions. Returns a pointer to the end of the move list.
-///
-/// generate<MV_NON_EVASION> generates all pseudo-legal captures and
-/// non-captures. Returns a pointer to the end of the move list.
-
-template<MoveType Type>
-MoveStack* generate(const Position& pos, MoveStack* mlist) {
-
- assert(pos.is_ok());
- assert(!pos.is_check());
-
- Color us = pos.side_to_move();
- Bitboard target;
-
- 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);
-
- if (Type == MV_NON_EVASION)
- {
- mlist = generate_piece_moves<PAWN, MV_CAPTURE>(pos, mlist, us, target);
- mlist = generate_piece_moves<PAWN, MV_NON_CAPTURE>(pos, mlist, us, pos.empty_squares());
- target |= pos.empty_squares();
- }
- else
- mlist = generate_piece_moves<PAWN, Type>(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);
-
- if (Type != MV_CAPTURE)
- {
- if (pos.can_castle_kingside(us))
- mlist = generate_castle_moves<KING_SIDE>(pos, mlist, us);
-
- if (pos.can_castle_queenside(us))
- mlist = generate_castle_moves<QUEEN_SIDE>(pos, mlist, us);
- }
-
- return mlist;
-}
-// Explicit template instantiation
-template MoveStack* generate<MV_CAPTURE>(const Position& pos, MoveStack* mlist);
-template MoveStack* generate<MV_NON_CAPTURE>(const Position& pos, MoveStack* mlist);
-template MoveStack* generate<MV_NON_EVASION>(const Position& pos, MoveStack* mlist);
+template<Color Us, GenType Type>
+ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
+ constexpr Color Them = ~Us;
+ constexpr Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+ constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
+ constexpr Direction Up = pawn_push(Us);
+ constexpr Direction UpRight = (Us == WHITE ? NORTH_EAST : SOUTH_WEST);
+ constexpr Direction UpLeft = (Us == WHITE ? NORTH_WEST : SOUTH_EAST);
-/// 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<MV_NON_CAPTURE_CHECK>(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));
-
- assert(pos.piece_on(ksq) == piece_of_color_and_type(opposite_color(us), KING));
-
- // Discovered non-capture checks
- b = dc = pos.discovered_check_candidates(us);
-
- 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;
- }
- }
-
- // 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);
-}
+ const Bitboard emptySquares = ~pos.pieces();
+ const Bitboard enemies = Type == EVASIONS ? pos.checkers() : pos.pieces(Them);
+ Bitboard pawnsOn7 = pos.pieces(Us, PAWN) & TRank7BB;
+ Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
-/// 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<MV_EVASION>(const Position& pos, MoveStack* mlist) {
-
- assert(pos.is_ok());
- assert(pos.is_check());
-
- Bitboard b, target;
- Square from, checksq;
- int checkersCnt = 0;
- Color us = pos.side_to_move();
- Square ksq = pos.king_square(us);
- Bitboard checkers = pos.checkers();
- Bitboard sliderAttacks = EmptyBoardBB;
-
- assert(pos.piece_on(ksq) == piece_of_color_and_type(us, KING));
- assert(checkers);
-
- // 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);
-
- assert(pos.color_of_piece_on(checksq) == opposite_color(us));
-
- switch (pos.type_of_piece_on(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 (RookPseudoAttacks[checksq] & (1ULL << ksq))
- sliderAttacks |= RookPseudoAttacks[checksq] | pos.attacks_from<BISHOP>(checksq);
- else
- sliderAttacks |= BishopPseudoAttacks[checksq] | pos.attacks_from<ROOK>(checksq);
- default:
- break;
- }
- } while (b);
-
- // 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);
-
- // 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<PAWN, MV_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);
-}
-
+ // Single and double pawn pushes, no promotions
+ if constexpr (Type != CAPTURES)
+ {
+ Bitboard b1 = shift<Up>(pawnsNotOn7) & emptySquares;
+ Bitboard b2 = shift<Up>(b1 & TRank3BB) & emptySquares;
-/// generate<MV_LEGAL / MV_PSEUDO_LEGAL> computes a complete list of legal
-/// or pseudo-legal moves in the current position.
-template<>
-inline MoveStack* generate<MV_PSEUDO_LEGAL>(const Position& pos, MoveStack* mlist) {
+ if constexpr (Type == EVASIONS) // Consider only blocking squares
+ {
+ b1 &= target;
+ b2 &= target;
+ }
- assert(pos.is_ok());
+ while (b1)
+ {
+ Square to = pop_lsb(b1);
+ *moveList++ = Move(to - Up, to);
+ }
- return pos.is_check() ? generate<MV_EVASION>(pos, mlist)
- : generate<MV_NON_EVASION>(pos, mlist);
-}
+ while (b2)
+ {
+ Square to = pop_lsb(b2);
+ *moveList++ = Move(to - Up - Up, to);
+ }
+ }
-template<>
-MoveStack* generate<MV_LEGAL>(const Position& pos, MoveStack* mlist) {
+ // Promotions and underpromotions
+ if (pawnsOn7)
+ {
+ Bitboard b1 = shift<UpRight>(pawnsOn7) & enemies;
+ Bitboard b2 = shift<UpLeft>(pawnsOn7) & enemies;
+ Bitboard b3 = shift<Up>(pawnsOn7) & emptySquares;
- assert(pos.is_ok());
+ if constexpr (Type == EVASIONS)
+ b3 &= target;
- MoveStack *last, *cur = mlist;
- Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
+ while (b1)
+ moveList = make_promotions<Type, UpRight, true>(moveList, pop_lsb(b1));
- last = generate<MV_PSEUDO_LEGAL>(pos, mlist);
+ while (b2)
+ moveList = make_promotions<Type, UpLeft, true>(moveList, pop_lsb(b2));
- // Remove illegal moves from the list
- while (cur != last)
- if (pos.pl_move_is_legal(cur->move, pinned))
- cur++;
- else
- cur->move = (--last)->move;
+ while (b3)
+ moveList = make_promotions<Type, Up, false>(moveList, pop_lsb(b3));
+ }
- return last;
-}
+ // Standard and en passant captures
+ if constexpr (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
+ {
+ Bitboard b1 = shift<UpRight>(pawnsNotOn7) & enemies;
+ Bitboard b2 = shift<UpLeft>(pawnsNotOn7) & enemies;
+ while (b1)
+ {
+ Square to = pop_lsb(b1);
+ *moveList++ = Move(to - UpRight, to);
+ }
-/// 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.
+ while (b2)
+ {
+ Square to = pop_lsb(b2);
+ *moveList++ = Move(to - UpLeft, to);
+ }
-bool move_is_legal(const Position& pos, const Move m) {
+ if (pos.ep_square() != SQ_NONE)
+ {
+ assert(rank_of(pos.ep_square()) == relative_rank(Us, RANK_6));
- MoveStack mlist[MOVES_MAX];
- MoveStack *cur, *last = generate<MV_PSEUDO_LEGAL>(pos, mlist);
+ // An en passant capture cannot resolve a discovered check
+ if (Type == EVASIONS && (target & (pos.ep_square() + Up)))
+ return moveList;
- for (cur = mlist; cur != last; cur++)
- if (cur->move == m)
- return pos.pl_move_is_legal(m, pos.pinned_pieces(pos.side_to_move()));
+ b1 = pawnsNotOn7 & pawn_attacks_bb(Them, pos.ep_square());
- return false;
-}
+ assert(b1);
+ while (b1)
+ *moveList++ = Move::make<EN_PASSANT>(pop_lsb(b1), pos.ep_square());
+ }
+ }
-/// 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(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_special(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;
-
- // The destination square cannot be occupied by a friendly piece
- if (pos.color_of_piece_on(to) == us)
- return false;
-
- // Handle the special case of a pawn move
- if (type_of_piece(pc) == PAWN)
- {
- // Move direction must be compatible with pawn color
- int direction = to - from;
- if ((us == WHITE) != (direction > 0))
- return false;
-
- // We have already handled promotion moves, so destination
- // cannot be on the 8/1th rank.
- if (square_rank(to) == RANK_8 || square_rank(to) == RANK_1)
- return false;
-
- // Proceed according to the square delta between the origin and
- // destination squares.
- switch (direction)
- {
- 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 false;
- break;
-
- case DELTA_N:
- case DELTA_S:
- // Pawn push. The destination square must be empty.
- if (!pos.square_is_empty(to))
- return false;
- 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 false;
- 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 false;
- break;
-
- default:
- return false;
- }
- }
- else if (!bit_is_set(pos.attacks_from(pc, from), to))
- return false;
-
- // The move is pseudo-legal, check if it is also legal
- return pos.is_check() ? pos.pl_move_is_evasion(m, pinned) : pos.pl_move_is_legal(m, pinned);
+ return moveList;
}
-namespace {
-
- template<Square Delta>
- inline Bitboard move_pawns(Bitboard p) {
-
- 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;
- }
-
- template<MoveType Type, Square Delta>
- inline MoveStack* generate_pawn_captures(MoveStack* mlist, Bitboard pawns, Bitboard target) {
-
- const Bitboard TFileABB = (Delta == DELTA_NE || Delta == DELTA_SE ? FileABB : FileHBB);
-
- Bitboard b;
- Square to;
-
- // Captures in the a1-h8 (a8-h1 for black) diagonal or in the h1-a8 (h8-a1 for black)
- b = move_pawns<Delta>(pawns) & target & ~TFileABB;
- SERIALIZE_MOVES_D(b, -Delta);
- return mlist;
- }
-
- template<Color Us, MoveType Type, Square Delta>
- inline MoveStack* generate_promotions(const Position& pos, MoveStack* mlist, Bitboard pawnsOn7, Bitboard target) {
-
- const Bitboard TFileABB = (Delta == DELTA_NE || Delta == DELTA_SE ? FileABB : FileHBB);
-
- Bitboard b;
- Square to;
-
- // Promotions and under-promotions, both captures and non-captures
- b = move_pawns<Delta>(pawnsOn7) & target;
-
- if (Delta != DELTA_N && Delta != DELTA_S)
- b &= ~TFileABB;
-
- while (b)
- {
- to = pop_1st_bit(&b);
+template<Color Us, PieceType Pt>
+ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
- if (Type == MV_CAPTURE || Type == MV_EVASION)
- (*mlist++).move = make_promotion_move(to - Delta, to, QUEEN);
+ static_assert(Pt != KING && Pt != PAWN, "Unsupported piece type in generate_moves()");
- 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);
- }
+ Bitboard bb = pos.pieces(Us, Pt);
- // 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<KNIGHT>(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 mlist;
- }
-
- template<Color Us, MoveType Type>
- MoveStack* generate_pawn_moves(const Position& pos, MoveStack* mlist, Bitboard target, Square ksq) {
-
- // 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);
-
- 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)
+ while (bb)
{
- emptySquares = (Type == MV_NON_CAPTURE ? target : pos.empty_squares());
- pawnPushes = move_pawns<TDELTA_N>(pawns & ~TRank7BB) & emptySquares;
- }
+ Square from = pop_lsb(bb);
+ Bitboard b = attacks_bb<Pt>(from, pos.pieces()) & target;
- if (Type == MV_EVASION)
- {
- emptySquares &= target; // Only blocking squares
- enemyPieces &= target; // Capture only the checker piece
+ while (b)
+ *moveList++ = Move(from, pop_lsb(b));
}
- // Promotions and underpromotions
- if (pawnsOn7)
- {
- if (Type == MV_CAPTURE)
- emptySquares = pos.empty_squares();
+ return moveList;
+}
- pawns &= ~TRank7BB;
- mlist = generate_promotions<Us, Type, TDELTA_NE>(pos, mlist, pawnsOn7, enemyPieces);
- mlist = generate_promotions<Us, Type, TDELTA_NW>(pos, mlist, pawnsOn7, enemyPieces);
- mlist = generate_promotions<Us, Type, TDELTA_N >(pos, mlist, pawnsOn7, emptySquares);
- }
- // Standard captures
- if (Type == MV_CAPTURE || Type == MV_EVASION)
- {
- mlist = generate_pawn_captures<Type, TDELTA_NE>(mlist, pawns, enemyPieces);
- mlist = generate_pawn_captures<Type, TDELTA_NW>(mlist, pawns, enemyPieces);
- }
+template<Color Us, GenType Type>
+ExtMove* generate_all(const Position& pos, ExtMove* moveList) {
- // Single and double pawn pushes
- if (Type != MV_CAPTURE)
- {
- b1 = pawnPushes & emptySquares;
- b2 = move_pawns<TDELTA_N>(pawnPushes & TRank3BB) & emptySquares;
+ static_assert(Type != LEGAL, "Unsupported type in generate_all()");
- if (Type == MV_CHECK)
- {
- // Consider only pawn moves which give direct checks
- b1 &= pos.attacks_from<PAWN>(ksq, Them);
- b2 &= pos.attacks_from<PAWN>(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<TDELTA_N>(pawns & target & ~file_bb(ksq)) & emptySquares;
- dc2 = move_pawns<TDELTA_N>(dc1 & TRank3BB) & emptySquares;
-
- b1 |= dc1;
- b2 |= dc2;
- }
- }
- SERIALIZE_MOVES_D(b1, -TDELTA_N);
- SERIALIZE_MOVES_D(b2, -TDELTA_N -TDELTA_N);
- }
+ const Square ksq = pos.square<KING>(Us);
+ Bitboard target;
- // En passant captures
- if ((Type == MV_CAPTURE || Type == MV_EVASION) && pos.ep_square() != SQ_NONE)
+ // Skip generating non-king moves when in double check
+ if (Type != EVASIONS || !more_than_one(pos.checkers()))
{
- assert(Us != WHITE || square_rank(pos.ep_square()) == RANK_6);
- assert(Us != BLACK || square_rank(pos.ep_square()) == RANK_3);
+ target = Type == EVASIONS ? between_bb(ksq, lsb(pos.checkers()))
+ : Type == NON_EVASIONS ? ~pos.pieces(Us)
+ : Type == CAPTURES ? pos.pieces(~Us)
+ : ~pos.pieces(); // QUIETS
+
+ moveList = generate_pawn_moves<Us, Type>(pos, moveList, target);
+ moveList = generate_moves<Us, KNIGHT>(pos, moveList, target);
+ moveList = generate_moves<Us, BISHOP>(pos, moveList, target);
+ moveList = generate_moves<Us, ROOK>(pos, moveList, target);
+ moveList = generate_moves<Us, QUEEN>(pos, moveList, target);
+ }
- // 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;
+ Bitboard b = attacks_bb<KING>(ksq) & (Type == EVASIONS ? ~pos.pieces(Us) : target);
- b1 = pawns & pos.attacks_from<PAWN>(pos.ep_square(), Them);
+ while (b)
+ *moveList++ = Move(ksq, pop_lsb(b));
- assert(b1 != EmptyBoardBB);
+ if ((Type == QUIETS || Type == NON_EVASIONS) && pos.can_castle(Us & ANY_CASTLING))
+ for (CastlingRights cr : {Us & KING_SIDE, Us & QUEEN_SIDE})
+ if (!pos.castling_impeded(cr) && pos.can_castle(cr))
+ *moveList++ = Move::make<CASTLING>(ksq, pos.castling_rook_square(cr));
- while (b1)
- {
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_ep_move(to, pos.ep_square());
- }
- }
- return mlist;
- }
+ return moveList;
+}
- template<CastlingSide Side>
- MoveStack* generate_castle_moves(const Position& pos, MoveStack* mlist, Color us) {
+} // namespace
- Color them = opposite_color(us);
- Square ksq = pos.king_square(us);
- assert(pos.piece_on(ksq) == piece_of_color_and_type(us, KING));
+// <CAPTURES> Generates all pseudo-legal captures plus queen promotions
+// <QUIETS> Generates all pseudo-legal non-captures and underpromotions
+// <EVASIONS> Generates all pseudo-legal check evasions
+// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
+//
+// Returns a pointer to the end of the move list.
+template<GenType Type>
+ExtMove* generate(const Position& pos, ExtMove* moveList) {
- 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;
+ static_assert(Type != LEGAL, "Unsupported type in generate()");
+ assert((Type == EVASIONS) == bool(pos.checkers()));
- assert(pos.piece_on(rsq) == piece_of_color_and_type(us, ROOK));
+ Color us = pos.side_to_move();
- // 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;
+ return us == WHITE ? generate_all<WHITE, Type>(pos, moveList)
+ : generate_all<BLACK, Type>(pos, moveList);
+}
- for (s = Min(rsq, s2); s <= Max(rsq, s2); s++)
- if (s != ksq && s != rsq && pos.square_is_occupied(s))
- illegal = true;
+// Explicit template instantiations
+template ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
+template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
+template ExtMove* generate<EVASIONS>(const Position&, ExtMove*);
+template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
- if ( Side == QUEEN_SIDE
- && square_file(rsq) == FILE_B
- && ( 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)
- (*mlist++).move = make_castle_move(ksq, rsq);
+// generate<LEGAL> generates all the legal moves in the given position
- return mlist;
- }
+template<>
+ExtMove* generate<LEGAL>(const Position& pos, ExtMove* moveList) {
+
+ Color us = pos.side_to_move();
+ Bitboard pinned = pos.blockers_for_king(us) & pos.pieces(us);
+ Square ksq = pos.square<KING>(us);
+ ExtMove* cur = moveList;
+
+ moveList =
+ pos.checkers() ? generate<EVASIONS>(pos, moveList) : generate<NON_EVASIONS>(pos, moveList);
+ while (cur != moveList)
+ if (((pinned & cur->from_sq()) || cur->from_sq() == ksq || cur->type_of() == EN_PASSANT)
+ && !pos.legal(*cur))
+ *cur = *(--moveList);
+ else
+ ++cur;
+
+ return moveList;
+}
-} // namespace
+} // namespace Stockfish