/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
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 "position.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
-////
+/// Simple macro to wrap a very common while loop, no facny, no flexibility,
+/// hardcoded names 'mlist' and 'from'.
+#define SERIALIZE(b) while (b) (mlist++)->move = make_move(from, pop_lsb(&b))
+/// Version used for pawns, where the 'from' square is given as a delta from the 'to' square
+#define SERIALIZE_PAWNS(b, d) while (b) { Square to = pop_lsb(&b); \
+ (mlist++)->move = make_move(to - (d), to); }
namespace {
- enum CastlingSide {
- KING_SIDE,
- QUEEN_SIDE
- };
-
- enum MoveType {
- CAPTURE,
- NON_CAPTURE,
- CHECK,
- EVASION
- };
-
- // Helper templates
- template<CastlingSide Side>
- MoveStack* generate_castle_moves(const Position&, MoveStack*);
+ template<CastlingSide Side, bool Checks, bool Chess960>
+ ExtMove* generate_castle(const Position& pos, ExtMove* mlist, Color us) {
- 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<>
- MoveStack* generate_piece_moves<KING>(const Position&, MoveStack*, Color, Bitboard);
+ if (pos.castle_impeded(us, Side) || !pos.can_castle(make_castle_right(us, Side)))
+ return mlist;
- template<PieceType Piece, MoveType Type>
- inline MoveStack* generate_piece_moves(const Position& p, MoveStack* m, Color us, Bitboard t) {
+ // After castling, the rook and king final positions are the same in Chess960
+ // as they would be in standard chess.
+ Square kfrom = pos.king_square(us);
+ Square rfrom = pos.castle_rook_square(us, Side);
+ Square kto = relative_square(us, Side == KING_SIDE ? SQ_G1 : SQ_C1);
+ Bitboard enemies = pos.pieces(~us);
- assert(Piece == PAWN);
- assert(Type == CAPTURE || Type == NON_CAPTURE || Type == EVASION);
+ assert(!pos.checkers());
- return (us == WHITE ? generate_pawn_moves<WHITE, Type>(p, m, t, SQ_NONE)
- : generate_pawn_moves<BLACK, Type>(p, m, t, SQ_NONE));
- }
+ const int K = Chess960 ? kto > kfrom ? -1 : 1
+ : Side == KING_SIDE ? -1 : 1;
- // Templates for non-capture checks generation
+ for (Square s = kto; s != kfrom; s += (Square)K)
+ if (pos.attackers_to(s) & enemies)
+ return mlist;
- template<PieceType Piece>
- MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from);
+ // Because we generate only legal castling moves we need to verify that
+ // when moving the castling rook we do not discover some hidden checker.
+ // For instance an enemy queen in SQ_A1 when castling rook is in SQ_B1.
+ if (Chess960 && (pos.attackers_to(kto, pos.pieces() ^ rfrom) & enemies))
+ return mlist;
- template<PieceType>
- MoveStack* generate_direct_checks(const Position&, MoveStack*, Color, Bitboard, Square);
+ (mlist++)->move = make<CASTLE>(kfrom, rfrom);
- template<>
- inline MoveStack* generate_direct_checks<PAWN>(const Position& p, MoveStack* m, Color us, Bitboard dc, Square ksq) {
+ if (Checks && !pos.move_gives_check((mlist - 1)->move, CheckInfo(pos)))
+ mlist--;
- return (us == WHITE ? generate_pawn_moves<WHITE, CHECK>(p, m, dc, ksq)
- : generate_pawn_moves<BLACK, CHECK>(p, m, dc, ksq));
+ return mlist;
}
-}
-
-
-////
-//// Functions
-////
-
-
-/// generate_captures() generates all pseudo-legal captures and queen
-/// promotions. Returns a pointer to the end of the move list.
-
-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));
-
- 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);
- mlist = generate_piece_moves<PAWN, CAPTURE>(pos, mlist, us, target);
- return generate_piece_moves<KING>(pos, mlist, us, target);
-}
+ template<GenType Type, Square Delta>
+ inline ExtMove* generate_promotions(ExtMove* mlist, Bitboard pawnsOn7,
+ Bitboard target, const CheckInfo* ci) {
-/// generate_noncaptures() generates all pseudo-legal non-captures and
-/// underpromotions. Returns a pointer to the end of the move list.
+ Bitboard b = shift_bb<Delta>(pawnsOn7) & target;
-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();
-
- 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);
- return generate_castle_moves<QUEEN_SIDE>(pos, 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.
-
-MoveStack* generate_non_capture_checks(const Position& pos, MoveStack* mlist) {
+ while (b)
+ {
+ Square to = pop_lsb(&b);
- assert(pos.is_ok());
- assert(!pos.is_check());
+ if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, QUEEN);
- Color us = pos.side_to_move();
- Square ksq = pos.king_square(opposite_color(us));
- Bitboard dc = pos.discovered_check_candidates(us);
+ if (Type == QUIETS || Type == EVASIONS || Type == NON_EVASIONS)
+ {
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, ROOK);
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, BISHOP);
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, KNIGHT);
+ }
- assert(pos.piece_on(ksq) == piece_of_color_and_type(opposite_color(us), KING));
+ // Knight-promotion is the only one that can give a direct check not
+ // already included in the queen-promotion.
+ if (Type == QUIET_CHECKS && (StepAttacksBB[W_KNIGHT][to] & ci->ksq))
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, KNIGHT);
+ else
+ (void)ci; // Silence a warning under MSVC
+ }
- // Discovered non-capture checks
- Bitboard b = dc;
- while (b)
- {
- Square 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 mlist;
}
- // 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);
-}
+ template<Color Us, GenType Type>
+ ExtMove* generate_pawn_moves(const Position& pos, ExtMove* mlist,
+ Bitboard target, const CheckInfo* ci) {
-/// 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.
+ // Compute 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 TRank8BB = (Us == WHITE ? Rank8BB : Rank1BB);
+ const Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+ const Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
+ const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
+ const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
+ const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
-MoveStack* generate_evasions(const Position& pos, MoveStack* mlist) {
+ Bitboard b1, b2, dc1, dc2, emptySquares;
- assert(pos.is_ok());
- assert(pos.is_check());
+ Bitboard pawnsOn7 = pos.pieces(Us, PAWN) & TRank7BB;
+ Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
- Bitboard b;
- 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);
+ Bitboard enemies = (Type == EVASIONS ? pos.pieces(Them) & target:
+ Type == CAPTURES ? target : pos.pieces(Them));
- 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 (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);
-
- // 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.
- Bitboard target = squares_between(checksq, ksq) | checkers;
-
- 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);
-}
-
-
-/// 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.
-
-MoveStack* generate_moves(const Position& pos, MoveStack* mlist, bool pseudoLegal) {
+ // Single and double pawn pushes, no promotions
+ if (Type != CAPTURES)
+ {
+ emptySquares = (Type == QUIETS || Type == QUIET_CHECKS ? target : ~pos.pieces());
- assert(pos.is_ok());
+ b1 = shift_bb<Up>(pawnsNotOn7) & emptySquares;
+ b2 = shift_bb<Up>(b1 & TRank3BB) & emptySquares;
- MoveStack* last;
- Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
+ if (Type == EVASIONS) // Consider only blocking squares
+ {
+ b1 &= target;
+ b2 &= target;
+ }
- // Generate pseudo-legal moves
- if (pos.is_check())
- last = generate_evasions(pos, mlist);
- else {
- last = generate_captures(pos, mlist);
- last = generate_noncaptures(pos, last);
- }
- if (pseudoLegal)
- return last;
+ if (Type == QUIET_CHECKS)
+ {
+ b1 &= pos.attacks_from<PAWN>(ci->ksq, Them);
+ b2 &= pos.attacks_from<PAWN>(ci->ksq, Them);
+
+ // Add pawn pushes 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. Note that a possible discovery check
+ // promotion has been already generated among captures.
+ if (pawnsNotOn7 & ci->dcCandidates)
+ {
+ dc1 = shift_bb<Up>(pawnsNotOn7 & ci->dcCandidates) & emptySquares & ~file_bb(ci->ksq);
+ dc2 = shift_bb<Up>(dc1 & TRank3BB) & emptySquares;
- // Remove illegal moves from the list
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (!pos.pl_move_is_legal(cur->move, pinned))
- {
- cur->move = (--last)->move;
- cur--;
- }
- return last;
-}
+ b1 |= dc1;
+ b2 |= dc2;
+ }
+ }
+ SERIALIZE_PAWNS(b1, Up);
+ SERIALIZE_PAWNS(b2, Up + Up);
+ }
-/// 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.
+ // Promotions and underpromotions
+ if (pawnsOn7 && (Type != EVASIONS || (target & TRank8BB)))
+ {
+ if (Type == CAPTURES)
+ emptySquares = ~pos.pieces();
-bool move_is_legal(const Position& pos, const Move m) {
+ if (Type == EVASIONS)
+ emptySquares &= target;
- MoveStack mlist[256];
- MoveStack* last = generate_moves(pos, mlist, true);
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (cur->move == m)
- return pos.pl_move_is_legal(m, pos.pinned_pieces(pos.side_to_move()));
+ mlist = generate_promotions<Type, Right>(mlist, pawnsOn7, enemies, ci);
+ mlist = generate_promotions<Type, Left >(mlist, pawnsOn7, enemies, ci);
+ mlist = generate_promotions<Type, Up>(mlist, pawnsOn7, emptySquares, ci);
+ }
- return false;
-}
+ // Standard and en-passant captures
+ if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
+ {
+ b1 = shift_bb<Right>(pawnsNotOn7) & enemies;
+ b2 = shift_bb<Left >(pawnsNotOn7) & enemies;
+ SERIALIZE_PAWNS(b1, Right);
+ SERIALIZE_PAWNS(b2, Left);
-/// 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.
+ if (pos.ep_square() != SQ_NONE)
+ {
+ assert(rank_of(pos.ep_square()) == relative_rank(Us, RANK_6));
-bool move_is_legal(const Position& pos, const Move m, Bitboard pinned) {
+ // 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 == EVASIONS && !(target & (pos.ep_square() - Up)))
+ return mlist;
- assert(pos.is_ok());
- assert(move_is_ok(m));
- assert(pinned == pos.pinned_pieces(pos.side_to_move()));
+ b1 = pawnsNotOn7 & pos.attacks_from<PAWN>(pos.ep_square(), Them);
- // Use a slower but simpler function for uncommon cases
- if (move_is_ep(m) || move_is_castle(m))
- return move_is_legal(pos, m);
+ assert(b1);
- 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);
-
- // 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;
-
- // 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 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;
+ while (b1)
+ (mlist++)->move = make<ENPASSANT>(pop_lsb(&b1), pos.ep_square());
+ }
+ }
- case DELTA_N:
- case DELTA_S:
- // Pawn push. The destination square must be empty.
- if (!pos.square_is_empty(to))
- return false;
- break;
+ return mlist;
+ }
- 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;
+ template<PieceType Pt, bool Checks> FORCE_INLINE
+ ExtMove* generate_moves(const Position& pos, ExtMove* mlist, Color us,
+ Bitboard target, const CheckInfo* ci) {
- default:
- 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);
- }
+ assert(Pt != KING && Pt != PAWN);
- // Luckly we can handle all the other pieces in one go
- 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);
-}
+ const Square* pl = pos.list<Pt>(us);
+ for (Square from = *pl; from != SQ_NONE; from = *++pl)
+ {
+ if (Checks)
+ {
+ if ( (Pt == BISHOP || Pt == ROOK || Pt == QUEEN)
+ && !(PseudoAttacks[Pt][from] & target & ci->checkSq[Pt]))
+ continue;
-namespace {
+ if (unlikely(ci->dcCandidates) && (ci->dcCandidates & from))
+ continue;
+ }
- template<PieceType Piece>
- MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
+ Bitboard b = pos.attacks_from<Pt>(from) & target;
- Square from;
- Bitboard b;
- const Square* ptr = pos.piece_list_begin(us, Piece);
+ if (Checks)
+ b &= ci->checkSq[Pt];
- while ((from = *ptr++) != SQ_NONE)
- {
- b = pos.attacks_from<Piece>(from) & target;
- SERIALIZE_MOVES(b);
+ SERIALIZE(b);
}
- return mlist;
- }
- template<>
- 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;
}
- 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, bool possiblePromotion) {
+ template<Color Us, GenType Type> FORCE_INLINE
+ ExtMove* generate_all(const Position& pos, ExtMove* mlist, Bitboard target,
+ const CheckInfo* ci = NULL) {
- // 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);
+ const bool Checks = Type == QUIET_CHECKS;
- Square to;
+ mlist = generate_pawn_moves<Us, Type>(pos, mlist, target, ci);
+ mlist = generate_moves<KNIGHT, Checks>(pos, mlist, Us, target, ci);
+ mlist = generate_moves<BISHOP, Checks>(pos, mlist, Us, target, ci);
+ mlist = generate_moves< ROOK, Checks>(pos, mlist, Us, target, ci);
+ mlist = generate_moves< QUEEN, Checks>(pos, mlist, Us, target, ci);
- // Captures in the a1-h8 (a8-h1 for black) diagonal or in the h1-a8 (h8-a1 for black)
- Bitboard b1 = move_pawns<Us, Diagonal>(pawns) & ~TFileABB & enemyPieces;
+ if (Type != QUIET_CHECKS && Type != EVASIONS)
+ {
+ Square from = pos.king_square(Us);
+ Bitboard b = pos.attacks_from<KING>(from) & target;
+ SERIALIZE(b);
+ }
- // Capturing promotions and under-promotions
- if (possiblePromotion)
+ if (Type != CAPTURES && Type != EVASIONS && pos.can_castle(Us))
{
- Bitboard b2 = b1 & TRank8BB;
- b1 &= ~TRank8BB;
- while (b2)
+ if (pos.is_chess960())
{
- 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);
+ mlist = generate_castle< KING_SIDE, Checks, true>(pos, mlist, Us);
+ mlist = generate_castle<QUEEN_SIDE, Checks, true>(pos, mlist, Us);
+ }
+ else
+ {
+ mlist = generate_castle< KING_SIDE, Checks, false>(pos, mlist, Us);
+ mlist = generate_castle<QUEEN_SIDE, Checks, false>(pos, mlist, Us);
}
}
- // Serialize standard captures
- if (Type == CAPTURE || Type == EVASION)
- SERIALIZE_MOVES_D(b1, -TTDELTA_NE);
-
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
- 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);
- bool possiblePromotion = pawns & TRank7BB;
+} // namespace
- // Standard captures and capturing promotions and underpromotions
- if (Type == CAPTURE || Type == EVASION || possiblePromotion)
- {
- enemyPieces = (Type == CAPTURE ? target : pos.pieces_of_color(opposite_color(Us)));
- if (Type == EVASION)
- enemyPieces &= target; // Capture only the checker piece
+/// generate<CAPTURES> generates all pseudo-legal captures and queen
+/// promotions. Returns a pointer to the end of the move list.
+///
+/// generate<QUIETS> generates all pseudo-legal non-captures and
+/// underpromotions. Returns a pointer to the end of the move list.
+///
+/// generate<NON_EVASIONS> generates all pseudo-legal captures and
+/// non-captures. Returns a pointer to the end of the move list.
- mlist = generate_pawn_captures<Us, Type, DELTA_NE>(mlist, pawns, enemyPieces, possiblePromotion);
- mlist = generate_pawn_captures<Us, Type, DELTA_NW>(mlist, pawns, enemyPieces, possiblePromotion);
- }
+template<GenType Type>
+ExtMove* generate(const Position& pos, ExtMove* mlist) {
- // Non-capturing promotions and underpromotions
- if (possiblePromotion)
- {
- b1 = move_pawns<Us, DELTA_N>(pawns) & TRank8BB & pos.empty_squares();
+ assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS);
+ assert(!pos.checkers());
- if (Type == EVASION)
- b1 &= target; // Only blocking promotion pushes
+ Color us = pos.side_to_move();
- while (b1)
- {
- to = pop_1st_bit(&b1);
+ Bitboard target = Type == CAPTURES ? pos.pieces(~us)
+ : Type == QUIETS ? ~pos.pieces()
+ : Type == NON_EVASIONS ? ~pos.pieces(us) : 0;
- if (Type == CAPTURE || Type == EVASION)
- (*mlist++).move = make_promotion_move(to - TDELTA_N, to, QUEEN);
+ return us == WHITE ? generate_all<WHITE, Type>(pos, mlist, target)
+ : generate_all<BLACK, Type>(pos, mlist, target);
+}
- 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);
- }
+// Explicit template instantiations
+template ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
+template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
+template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
- // 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);
- }
- }
- // Standard pawn pushes and double pushes
- if (Type != CAPTURE)
- {
- emptySquares = (Type == NON_CAPTURE ? target : pos.empty_squares());
+/// generate<QUIET_CHECKS> generates all pseudo-legal non-captures and knight
+/// underpromotions that give check. Returns a pointer to the end of the move list.
+template<>
+ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* mlist) {
- // Single and double pawn pushes
- b1 = move_pawns<Us, DELTA_N>(pawns) & emptySquares & ~TRank8BB;
- b2 = move_pawns<Us, DELTA_N>(b1 & TRank3BB) & emptySquares;
+ assert(!pos.checkers());
- // 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);
- }
+ Color us = pos.side_to_move();
+ CheckInfo ci(pos);
+ Bitboard dc = ci.dcCandidates;
- // En passant captures
- if ((Type == CAPTURE || Type == 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);
+ while (dc)
+ {
+ Square from = pop_lsb(&dc);
+ PieceType pt = type_of(pos.piece_on(from));
- // 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;
+ if (pt == PAWN)
+ continue; // Will be generated togheter with direct checks
- b1 = pawns & pos.attacks_from<PAWN>(pos.ep_square(), Them);
+ Bitboard b = pos.attacks_from(Piece(pt), from) & ~pos.pieces();
- assert(b1 != EmptyBoardBB);
+ if (pt == KING)
+ b &= ~PseudoAttacks[QUEEN][ci.ksq];
- while (b1)
- {
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_ep_move(to, pos.ep_square());
- }
- }
- return mlist;
+ SERIALIZE(b);
}
- template<PieceType Piece>
- 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;
- }
+ return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &ci)
+ : generate_all<BLACK, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &ci);
+}
- template<PieceType Piece>
- MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us,
- Bitboard dc, Square ksq) {
- assert(Piece != KING);
- Square from;
- Bitboard checkSqs;
- const Square* ptr = pos.piece_list_begin(us, Piece);
+/// 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<>
+ExtMove* generate<EVASIONS>(const Position& pos, ExtMove* mlist) {
- if ((from = *ptr++) == SQ_NONE)
- return mlist;
+ assert(pos.checkers());
- checkSqs = pos.attacks_from<Piece>(ksq) & pos.empty_squares();
+ int checkersCnt = 0;
+ Color us = pos.side_to_move();
+ Square ksq = pos.king_square(us), from = ksq /* For SERIALIZE */, checksq;
+ Bitboard sliderAttacks = 0;
+ Bitboard b = pos.checkers();
- do
- {
- if ( (Piece == QUEEN && !(QueenPseudoAttacks[from] & checkSqs))
- || (Piece == ROOK && !(RookPseudoAttacks[from] & checkSqs))
- || (Piece == BISHOP && !(BishopPseudoAttacks[from] & checkSqs)))
- continue;
+ assert(pos.checkers());
- if (dc && bit_is_set(dc, from))
- continue;
+ // Find squares attacked by slider checkers, we will remove them from the king
+ // evasions so to skip known illegal moves avoiding useless legality check later.
+ do
+ {
+ checkersCnt++;
+ checksq = pop_lsb(&b);
- Bitboard bb = pos.attacks_from<Piece>(from) & checkSqs;
- SERIALIZE_MOVES(bb);
+ assert(color_of(pos.piece_on(checksq)) == ~us);
- } while ((from = *ptr++) != SQ_NONE);
+ switch (type_of(pos.piece_on(checksq)))
+ {
+ case BISHOP: sliderAttacks |= PseudoAttacks[BISHOP][checksq]; break;
+ case ROOK: sliderAttacks |= PseudoAttacks[ROOK][checksq]; break;
+ case QUEEN:
+ // If queen and king are far or not on a diagonal line we can safely
+ // remove all the squares attacked in the other direction becuase are
+ // not reachable by the king anyway.
+ if (between_bb(ksq, checksq) || !(PseudoAttacks[BISHOP][checksq] & ksq))
+ sliderAttacks |= PseudoAttacks[QUEEN][checksq];
+
+ // Otherwise we need to use real rook attacks to check if king is safe
+ // to move in the other direction. For example: king in B2, queen in A1
+ // a knight in B1, and we can safely move to C1.
+ else
+ sliderAttacks |= PseudoAttacks[BISHOP][checksq] | pos.attacks_from<ROOK>(checksq);
- return mlist;
- }
+ default:
+ break;
+ }
+ } while (b);
- template<CastlingSide Side>
- MoveStack* generate_castle_moves(const Position& pos, MoveStack* mlist) {
+ // Generate evasions for king, capture and non capture moves
+ b = pos.attacks_from<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
+ SERIALIZE(b);
- Color us = pos.side_to_move();
+ if (checkersCnt > 1)
+ return mlist; // Double check, only a king move can save the day
- if ( (Side == KING_SIDE && pos.can_castle_kingside(us))
- ||(Side == QUEEN_SIDE && pos.can_castle_queenside(us)))
- {
- Color them = opposite_color(us);
- Square ksq = pos.king_square(us);
+ // Generate blocking evasions or captures of the checking piece
+ Bitboard target = between_bb(checksq, ksq) | checksq;
- assert(pos.piece_on(ksq) == piece_of_color_and_type(us, KING));
+ return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, mlist, target)
+ : generate_all<BLACK, EVASIONS>(pos, mlist, target);
+}
- 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;
- assert(pos.piece_on(rsq) == piece_of_color_and_type(us, ROOK));
+/// generate<LEGAL> generates all the legal moves in the given position
- // 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;
+template<>
+ExtMove* generate<LEGAL>(const Position& pos, ExtMove* mlist) {
- for (s = Min(rsq, s2); s <= Max(rsq, s2); s++)
- if (s != ksq && s != rsq && pos.square_is_occupied(s))
- illegal = true;
+ ExtMove *end, *cur = mlist;
+ Bitboard pinned = pos.pinned_pieces();
+ Square ksq = pos.king_square(pos.side_to_move());
- 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;
+ end = pos.checkers() ? generate<EVASIONS>(pos, mlist)
+ : generate<NON_EVASIONS>(pos, mlist);
+ while (cur != end)
+ if ( (pinned || from_sq(cur->move) == ksq || type_of(cur->move) == ENPASSANT)
+ && !pos.pl_move_is_legal(cur->move, pinned))
+ cur->move = (--end)->move;
+ else
+ cur++;
- if (!illegal)
- (*mlist++).move = make_castle_move(ksq, rsq);
- }
- return mlist;
- }
+ return end;
}
projects / stockfish / blobdiff