/*
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) 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
*/
#include <cassert>
-#include <algorithm>
-#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); }
+/// 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
- };
+ template<CastlingSide Side, bool Checks, bool Chess960>
+ ExtMove* generate_castle(const Position& pos, ExtMove* mlist, Color us) {
+
+ if (pos.castle_impeded(us, Side) || !pos.can_castle(make_castle_right(us, Side)))
+ return mlist;
+
+ // 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);
- template<CastlingSide>
- MoveStack* generate_castle_moves(const Position&, MoveStack*, Color us);
+ assert(!pos.checkers());
- template<Color, MoveType>
- MoveStack* generate_pawn_moves(const Position&, MoveStack*, Bitboard, Square);
+ const int K = Chess960 ? kto > kfrom ? -1 : 1
+ : Side == KING_SIDE ? -1 : 1;
- template<PieceType Pt>
- inline MoveStack* generate_discovered_checks(const Position& pos, MoveStack* mlist, Square from) {
+ for (Square s = kto; s != kfrom; s += (Square)K)
+ if (pos.attackers_to(s) & enemies)
+ return mlist;
- assert(Pt != QUEEN);
- assert(Pt != PAWN);
+ // 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;
- Bitboard b = pos.attacks_from<Pt>(from) & pos.empty_squares();
+ (mlist++)->move = make<CASTLE>(kfrom, rfrom);
- if (Pt == KING)
- b &= ~QueenPseudoAttacks[pos.king_square(flip(pos.side_to_move()))];
+ if (Checks && !pos.move_gives_check((mlist - 1)->move, CheckInfo(pos)))
+ mlist--;
- SERIALIZE_MOVES(b);
return mlist;
}
- template<PieceType Pt>
- inline MoveStack* generate_direct_checks(const Position& pos, MoveStack* mlist, Color us,
- Bitboard dc, Square ksq) {
- assert(Pt != KING);
- assert(Pt != PAWN);
- Bitboard checkSqs, b;
- Square from;
- const Square* pl = pos.piece_list(us, Pt);
+ template<GenType Type, Square Delta>
+ inline ExtMove* generate_promotions(ExtMove* mlist, Bitboard pawnsOn7,
+ Bitboard target, const CheckInfo* ci) {
- if ((from = *pl++) == SQ_NONE)
- return mlist;
+ Bitboard b = shift_bb<Delta>(pawnsOn7) & target;
- checkSqs = pos.attacks_from<Pt>(ksq) & pos.empty_squares();
-
- do
+ while (b)
{
- if ( (Pt == QUEEN && !(QueenPseudoAttacks[from] & checkSqs))
- || (Pt == ROOK && !(RookPseudoAttacks[from] & checkSqs))
- || (Pt == BISHOP && !(BishopPseudoAttacks[from] & checkSqs)))
- continue;
+ Square to = pop_lsb(&b);
- if (dc && bit_is_set(dc, from))
- continue;
+ if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
+ (mlist++)->move = make<PROMOTION>(to - Delta, to, QUEEN);
- b = pos.attacks_from<Pt>(from) & checkSqs;
- SERIALIZE_MOVES(b);
+ 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);
+ }
- } while ((from = *pl++) != SQ_NONE);
+ // 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
+ }
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<Color Us, GenType Type>
+ ExtMove* generate_pawn_moves(const Position& pos, ExtMove* mlist,
+ Bitboard target, const CheckInfo* ci) {
+
+ // 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);
+
+ Bitboard b1, b2, dc1, dc2, emptySquares;
+
+ Bitboard pawnsOn7 = pos.pieces(Us, PAWN) & TRank7BB;
+ Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
+
+ Bitboard enemies = (Type == EVASIONS ? pos.pieces(Them) & target:
+ Type == CAPTURES ? target : pos.pieces(Them));
+
+ // Single and double pawn pushes, no promotions
+ if (Type != CAPTURES)
+ {
+ emptySquares = (Type == QUIETS || Type == QUIET_CHECKS ? target : ~pos.pieces());
+
+ b1 = shift_bb<Up>(pawnsNotOn7) & emptySquares;
+ b2 = shift_bb<Up>(b1 & TRank3BB) & emptySquares;
+
+ if (Type == EVASIONS) // Consider only blocking squares
+ {
+ b1 &= target;
+ b2 &= target;
+ }
+
+ if (Type == QUIET_CHECKS)
+ {
+ b1 &= pos.attacks_from<PAWN>(ci->ksq, Them);
+ b2 &= pos.attacks_from<PAWN>(ci->ksq, Them);
- template<PieceType Pt, MoveType Type>
- FORCE_INLINE MoveStack* generate_piece_moves(const Position& p, MoveStack* m, Color us, Bitboard t) {
+ // 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;
- assert(Pt == PAWN);
- assert(Type == MV_CAPTURE || Type == MV_NON_CAPTURE || Type == MV_EVASION);
+ b1 |= dc1;
+ b2 |= dc2;
+ }
+ }
+
+ SERIALIZE_PAWNS(b1, Up);
+ SERIALIZE_PAWNS(b2, Up + Up);
+ }
+
+ // Promotions and underpromotions
+ if (pawnsOn7 && (Type != EVASIONS || (target & TRank8BB)))
+ {
+ if (Type == CAPTURES)
+ emptySquares = ~pos.pieces();
+
+ if (Type == EVASIONS)
+ emptySquares &= target;
+
+ 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);
+ }
+
+ // 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;
- return (us == WHITE ? generate_pawn_moves<WHITE, Type>(p, m, t, SQ_NONE)
- : generate_pawn_moves<BLACK, Type>(p, m, t, SQ_NONE));
+ SERIALIZE_PAWNS(b1, Right);
+ SERIALIZE_PAWNS(b2, Left);
+
+ if (pos.ep_square() != SQ_NONE)
+ {
+ assert(rank_of(pos.ep_square()) == relative_rank(Us, RANK_6));
+
+ // 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;
+
+ b1 = pawnsNotOn7 & pos.attacks_from<PAWN>(pos.ep_square(), Them);
+
+ assert(b1);
+
+ while (b1)
+ (mlist++)->move = make<ENPASSANT>(pop_lsb(&b1), pos.ep_square());
+ }
+ }
+
+ return mlist;
}
- template<PieceType Pt>
- FORCE_INLINE MoveStack* generate_piece_moves(const Position& pos, MoveStack* mlist, Color us, Bitboard target) {
- Bitboard b;
- Square from;
- const Square* pl = pos.piece_list(us, Pt);
+ template<PieceType Pt, bool Checks> FORCE_INLINE
+ ExtMove* generate_moves(const Position& pos, ExtMove* mlist, Color us,
+ Bitboard target, const CheckInfo* ci) {
+
+ assert(Pt != KING && Pt != PAWN);
+
+ const Square* pl = pos.list<Pt>(us);
- if (*pl != SQ_NONE)
+ for (Square from = *pl; from != SQ_NONE; from = *++pl)
{
- do {
- from = *pl;
- b = pos.attacks_from<Pt>(from) & target;
- SERIALIZE_MOVES(b);
- } while (*++pl != SQ_NONE);
+ if (Checks)
+ {
+ if ( (Pt == BISHOP || Pt == ROOK || Pt == QUEEN)
+ && !(PseudoAttacks[Pt][from] & target & ci->checkSq[Pt]))
+ continue;
+
+ if (unlikely(ci->dcCandidates) && (ci->dcCandidates & from))
+ continue;
+ }
+
+ Bitboard b = pos.attacks_from<Pt>(from) & target;
+
+ if (Checks)
+ b &= ci->checkSq[Pt];
+
+ SERIALIZE(b);
}
+
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);
+ template<Color Us, GenType Type> FORCE_INLINE
+ ExtMove* generate_all(const Position& pos, ExtMove* mlist, Bitboard target,
+ const CheckInfo* ci = NULL) {
+
+ const bool Checks = Type == QUIET_CHECKS;
+
+ 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);
+
+ if (Type != QUIET_CHECKS && Type != EVASIONS)
+ {
+ Square from = pos.king_square(Us);
+ Bitboard b = pos.attacks_from<KING>(from) & target;
+ SERIALIZE(b);
+ }
+
+ if (Type != CAPTURES && Type != EVASIONS && pos.can_castle(Us))
+ {
+ if (pos.is_chess960())
+ {
+ 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);
+ }
+ }
- b = pos.attacks_from<KING>(from) & target;
- SERIALIZE_MOVES(b);
return mlist;
}
-}
+
+} // namespace
-/// generate<MV_CAPTURE> generates all pseudo-legal captures and queen
+/// generate<CAPTURES> 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
+/// generate<QUIETS> 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
+/// generate<NON_EVASIONS> 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) {
+template<GenType Type>
+ExtMove* generate(const Position& pos, ExtMove* mlist) {
- assert(!pos.in_check());
+ assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS);
+ assert(!pos.checkers());
Color us = pos.side_to_move();
- Bitboard target;
- if (Type == MV_CAPTURE || Type == MV_NON_EVASION)
- target = pos.pieces(flip(us));
- else if (Type == MV_NON_CAPTURE)
- target = pos.empty_squares();
- else
- assert(false);
+ Bitboard target = Type == CAPTURES ? pos.pieces(~us)
+ : Type == QUIETS ? ~pos.pieces()
+ : Type == NON_EVASIONS ? ~pos.pieces(us) : 0;
- 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 && pos.can_castle(us))
- {
- if (pos.can_castle(us == WHITE ? WHITE_OO : BLACK_OO))
- mlist = generate_castle_moves<KING_SIDE>(pos, mlist, us);
-
- if (pos.can_castle(us == WHITE ? WHITE_OOO : BLACK_OOO))
- mlist = generate_castle_moves<QUEEN_SIDE>(pos, mlist, us);
- }
-
- return mlist;
+ return us == WHITE ? generate_all<WHITE, Type>(pos, mlist, target)
+ : generate_all<BLACK, Type>(pos, mlist, target);
}
// Explicit template instantiations
-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 ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
+template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
+template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
-/// generate_non_capture_checks() generates all pseudo-legal non-captures and knight
+/// 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<>
-MoveStack* generate<MV_NON_CAPTURE_CHECK>(const Position& pos, MoveStack* mlist) {
+ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* mlist) {
- assert(!pos.in_check());
+ assert(!pos.checkers());
- Bitboard b, dc;
- Square from;
Color us = pos.side_to_move();
- Square ksq = pos.king_square(flip(us));
+ CheckInfo ci(pos);
+ Bitboard dc = ci.dcCandidates;
- assert(pos.piece_on(ksq) == make_piece(flip(us), KING));
+ while (dc)
+ {
+ Square from = pop_lsb(&dc);
+ PieceType pt = type_of(pos.piece_on(from));
- // Discovered non-capture checks
- b = dc = pos.discovered_check_candidates();
+ if (pt == PAWN)
+ continue; // Will be generated togheter with direct checks
- while (b)
- {
- from = pop_1st_bit(&b);
- switch (type_of(pos.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;
- }
+ Bitboard b = pos.attacks_from(Piece(pt), from) & ~pos.pieces();
+
+ if (pt == KING)
+ b &= ~PseudoAttacks[QUEEN][ci.ksq];
+
+ SERIALIZE(b);
}
- // 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);
+ return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &ci)
+ : generate_all<BLACK, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &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.
+/// 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) {
+ExtMove* generate<EVASIONS>(const Position& pos, ExtMove* mlist) {
- assert(pos.in_check());
+ assert(pos.checkers());
- 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();
+ Square ksq = pos.king_square(us), from = ksq /* For SERIALIZE */, checksq;
Bitboard sliderAttacks = 0;
+ Bitboard b = pos.checkers();
- assert(pos.piece_on(ksq) == make_piece(us, KING));
- assert(checkers);
+ assert(pos.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;
+ // 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_1st_bit(&b);
+ checksq = pop_lsb(&b);
- assert(color_of(pos.piece_on(checksq)) == flip(us));
+ assert(color_of(pos.piece_on(checksq)) == ~us);
switch (type_of(pos.piece_on(checksq)))
{
- case BISHOP: sliderAttacks |= BishopPseudoAttacks[checksq]; break;
- case ROOK: sliderAttacks |= RookPseudoAttacks[checksq]; break;
+ case BISHOP: sliderAttacks |= PseudoAttacks[BISHOP][checksq]; break;
+ case ROOK: sliderAttacks |= PseudoAttacks[ROOK][checksq]; break;
case QUEEN:
- // If queen and king are far we can safely remove all the squares attacked
- // in the other direction becuase are not reachable by the king anyway.
- if (squares_between(ksq, checksq) || (RookPseudoAttacks[checksq] & (1ULL << ksq)))
- sliderAttacks |= QueenPseudoAttacks[checksq];
-
- // Otherwise, if king and queen are adjacent and on a diagonal line, 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.
+ // 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 |= BishopPseudoAttacks[checksq] | pos.attacks_from<ROOK>(checksq);
+ sliderAttacks |= PseudoAttacks[BISHOP][checksq] | pos.attacks_from<ROOK>(checksq);
default:
break;
// Generate evasions for king, capture and non capture moves
b = pos.attacks_from<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
- from = ksq;
- SERIALIZE_MOVES(b);
+ SERIALIZE(b);
- // Generate evasions for other pieces only if not double check
if (checkersCnt > 1)
- return mlist;
+ return mlist; // Double check, only a king move can save the day
- // Find squares where a blocking evasion or a capture of the
- // checker piece is possible.
- target = squares_between(checksq, ksq) | checkers;
+ // Generate blocking evasions or captures of the checking piece
+ Bitboard target = between_bb(checksq, ksq) | checksq;
- 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);
+ return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, mlist, target)
+ : generate_all<BLACK, EVASIONS>(pos, mlist, target);
}
-/// generate<MV_LEGAL> computes a complete list of legal moves in the current position
+/// generate<LEGAL> generates all the legal moves in the given position
template<>
-MoveStack* generate<MV_LEGAL>(const Position& pos, MoveStack* mlist) {
+ExtMove* generate<LEGAL>(const Position& pos, ExtMove* mlist) {
- MoveStack *last, *cur = mlist;
+ ExtMove *end, *cur = mlist;
Bitboard pinned = pos.pinned_pieces();
-
- last = pos.in_check() ? generate<MV_EVASION>(pos, mlist)
- : generate<MV_NON_EVASION>(pos, mlist);
-
- // Remove illegal moves from the list
- while (cur != last)
- if (!pos.pl_move_is_legal(cur->move, pinned))
- cur->move = (--last)->move;
+ Square ksq = pos.king_square(pos.side_to_move());
+
+ 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++;
- return last;
+ return end;
}
-
-
-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<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);
-
- if (Type == MV_CAPTURE || Type == MV_EVASION)
- (*mlist++).move = make_promotion_move(to - Delta, to, QUEEN);
-
- 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);
- }
-
- // 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(Delta > 0 ? BLACK : WHITE)))
- (*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 UP = (Us == WHITE ? DELTA_N : DELTA_S);
- const Square RIGHT_UP = (Us == WHITE ? DELTA_NE : DELTA_SW);
- const Square LEFT_UP = (Us == WHITE ? DELTA_NW : DELTA_SE);
-
- 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(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<UP>(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<Type, RIGHT_UP>(pos, mlist, pawnsOn7, enemyPieces);
- mlist = generate_promotions<Type, LEFT_UP>(pos, mlist, pawnsOn7, enemyPieces);
- mlist = generate_promotions<Type, UP>(pos, mlist, pawnsOn7, emptySquares);
- }
-
- // Standard captures
- if (Type == MV_CAPTURE || Type == MV_EVASION)
- {
- mlist = generate_pawn_captures<Type, RIGHT_UP>(mlist, pawns, enemyPieces);
- mlist = generate_pawn_captures<Type, LEFT_UP>(mlist, pawns, enemyPieces);
- }
-
- // Single and double pawn pushes
- if (Type != MV_CAPTURE)
- {
- b1 = (Type != MV_EVASION ? pawnPushes : pawnPushes & emptySquares);
- b2 = move_pawns<UP>(pawnPushes & TRank3BB) & emptySquares;
-
- 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<UP>(pawns & target & ~file_bb(ksq)) & emptySquares;
- dc2 = move_pawns<UP>(dc1 & TRank3BB) & emptySquares;
-
- b1 |= dc1;
- b2 |= dc2;
- }
- }
- SERIALIZE_MOVES_D(b1, -UP);
- SERIALIZE_MOVES_D(b2, -UP -UP);
- }
-
- // En passant captures
- if ((Type == MV_CAPTURE || Type == MV_EVASION) && pos.ep_square() != SQ_NONE)
- {
- assert(Us != WHITE || rank_of(pos.ep_square()) == RANK_6);
- assert(Us != BLACK || rank_of(pos.ep_square()) == RANK_3);
-
- // 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() - UP))
- return mlist;
-
- b1 = pawns & pos.attacks_from<PAWN>(pos.ep_square(), Them);
-
- assert(b1);
-
- while (b1)
- {
- to = pop_1st_bit(&b1);
- (*mlist++).move = make_enpassant_move(to, pos.ep_square());
- }
- }
- return mlist;
- }
-
- template<CastlingSide Side>
- MoveStack* generate_castle_moves(const Position& pos, MoveStack* mlist, Color us) {
-
- CastleRight f = CastleRight((Side == KING_SIDE ? WHITE_OO : WHITE_OOO) << us);
- Color them = flip(us);
-
- // After castling, the rook and king's final positions are exactly the same
- // in Chess960 as they would be in standard chess.
- Square kfrom = pos.king_square(us);
- Square rfrom = pos.castle_rook_square(f);
- Square kto = relative_square(us, Side == KING_SIDE ? SQ_G1 : SQ_C1);
- Square rto = relative_square(us, Side == KING_SIDE ? SQ_F1 : SQ_D1);
-
- assert(!pos.in_check());
- assert(pos.piece_on(kfrom) == make_piece(us, KING));
- assert(pos.piece_on(rfrom) == make_piece(us, ROOK));
-
- // Unimpeded rule: All the squares between the king's initial and final squares
- // (including the final square), and all the squares between the rook's initial
- // and final squares (including the final square), must be vacant except for
- // the king and castling rook.
- for (Square s = std::min(kfrom, kto); s <= std::max(kfrom, kto); s++)
- if ( (s != kfrom && s != rfrom && !pos.square_is_empty(s))
- ||(pos.attackers_to(s) & pos.pieces(them)))
- return mlist;
-
- for (Square s = std::min(rfrom, rto); s <= std::max(rfrom, rto); s++)
- if (s != kfrom && s != rfrom && !pos.square_is_empty(s))
- return mlist;
-
- // 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 (pos.is_chess960())
- {
- Bitboard occ = pos.occupied_squares();
- clear_bit(&occ, rfrom);
- if (pos.attackers_to(kto, occ) & pos.pieces(them))
- return mlist;
- }
-
- (*mlist++).move = make_castle_move(kfrom, rfrom);
-
- return mlist;
- }
-
-} // namespace
projects / stockfish / blobdiff