/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2004-2021 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
#include "movegen.h"
#include "position.h"
-/// 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 {
- 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);
-
- assert(!pos.checkers());
-
- const int K = Chess960 ? kto > kfrom ? -1 : 1
- : Side == KING_SIDE ? -1 : 1;
-
- for (Square s = kto; s != kfrom; s += (Square)K)
- if (pos.attackers_to(s) & enemies)
- 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 (Chess960 && (attacks_bb<ROOK>(kto, pos.pieces() ^ rfrom) & pos.pieces(~us, ROOK, QUEEN)))
- return mlist;
-
- (mlist++)->move = make<CASTLE>(kfrom, rfrom);
+ template<GenType Type, Direction D>
+ ExtMove* make_promotions(ExtMove* moveList, Square to, Square ksq) {
- if (Checks && !pos.gives_check((mlist - 1)->move, CheckInfo(pos)))
- --mlist;
-
- return mlist;
- }
-
-
- template<GenType Type, Square Delta>
- inline ExtMove* generate_promotions(ExtMove* mlist, Bitboard pawnsOn7,
- Bitboard target, const CheckInfo* ci) {
-
- Bitboard b = shift_bb<Delta>(pawnsOn7) & target;
-
- while (b)
+ if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
{
- Square to = pop_lsb(&b);
-
- if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
- (mlist++)->move = make<PROMOTION>(to - Delta, to, QUEEN);
-
- 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);
- }
+ *moveList++ = make<PROMOTION>(to - D, to, QUEEN);
+ if (attacks_bb<KNIGHT>(to) & ksq)
+ *moveList++ = make<PROMOTION>(to - D, to, KNIGHT);
+ }
- // 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
+ if (Type == QUIETS || Type == EVASIONS || Type == NON_EVASIONS)
+ {
+ *moveList++ = make<PROMOTION>(to - D, to, ROOK);
+ *moveList++ = make<PROMOTION>(to - D, to, BISHOP);
+ if (!(attacks_bb<KNIGHT>(to) & ksq))
+ *moveList++ = make<PROMOTION>(to - D, to, KNIGHT);
}
- return mlist;
+ return moveList;
}
template<Color Us, GenType Type>
- ExtMove* generate_pawn_moves(const Position& pos, ExtMove* mlist,
- Bitboard target, const CheckInfo* ci) {
+ ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
- // 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);
+ 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);
- Bitboard b1, b2, dc1, dc2, emptySquares;
+ const Square ksq = pos.square<KING>(Them);
+ Bitboard emptySquares;
Bitboard pawnsOn7 = pos.pieces(Us, PAWN) & TRank7BB;
Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
{
emptySquares = (Type == QUIETS || Type == QUIET_CHECKS ? target : ~pos.pieces());
- b1 = shift_bb<Up>(pawnsNotOn7) & emptySquares;
- b2 = shift_bb<Up>(b1 & TRank3BB) & emptySquares;
+ Bitboard b1 = shift<Up>(pawnsNotOn7) & emptySquares;
+ Bitboard b2 = shift<Up>(b1 & TRank3BB) & emptySquares;
if (Type == EVASIONS) // Consider only blocking squares
{
if (Type == QUIET_CHECKS)
{
- b1 &= pos.attacks_from<PAWN>(ci->ksq, Them);
- b2 &= pos.attacks_from<PAWN>(ci->ksq, Them);
+ b1 &= pawn_attacks_bb(Them, ksq);
+ b2 &= pawn_attacks_bb(Them, ksq);
// 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)
+ // don't generate captures. Note that a possible discovered check
+ // promotion has been already generated amongst the captures.
+ Bitboard dcCandidateQuiets = pos.blockers_for_king(Them) & pawnsNotOn7;
+ if (dcCandidateQuiets)
{
- dc1 = shift_bb<Up>(pawnsNotOn7 & ci->dcCandidates) & emptySquares & ~file_bb(ci->ksq);
- dc2 = shift_bb<Up>(dc1 & TRank3BB) & emptySquares;
+ Bitboard dc1 = shift<Up>(dcCandidateQuiets) & emptySquares & ~file_bb(ksq);
+ Bitboard dc2 = shift<Up>(dc1 & TRank3BB) & emptySquares;
b1 |= dc1;
b2 |= dc2;
}
}
- SERIALIZE_PAWNS(b1, Up);
- SERIALIZE_PAWNS(b2, Up + Up);
+ while (b1)
+ {
+ Square to = pop_lsb(&b1);
+ *moveList++ = make_move(to - Up, to);
+ }
+
+ while (b2)
+ {
+ Square to = pop_lsb(&b2);
+ *moveList++ = make_move(to - Up - Up, to);
+ }
}
// Promotions and underpromotions
- if (pawnsOn7 && (Type != EVASIONS || (target & TRank8BB)))
+ if (pawnsOn7)
{
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);
+ Bitboard b1 = shift<UpRight>(pawnsOn7) & enemies;
+ Bitboard b2 = shift<UpLeft >(pawnsOn7) & enemies;
+ Bitboard b3 = shift<Up >(pawnsOn7) & emptySquares;
+
+ while (b1)
+ moveList = make_promotions<Type, UpRight>(moveList, pop_lsb(&b1), ksq);
+
+ while (b2)
+ moveList = make_promotions<Type, UpLeft >(moveList, pop_lsb(&b2), ksq);
+
+ while (b3)
+ moveList = make_promotions<Type, Up >(moveList, pop_lsb(&b3), ksq);
}
- // Standard and en-passant captures
+ // 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;
+ Bitboard b1 = shift<UpRight>(pawnsNotOn7) & enemies;
+ Bitboard b2 = shift<UpLeft >(pawnsNotOn7) & enemies;
- SERIALIZE_PAWNS(b1, Right);
- SERIALIZE_PAWNS(b2, Left);
+ while (b1)
+ {
+ Square to = pop_lsb(&b1);
+ *moveList++ = make_move(to - UpRight, to);
+ }
+
+ while (b2)
+ {
+ Square to = pop_lsb(&b2);
+ *moveList++ = make_move(to - UpLeft, to);
+ }
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;
+ // An en passant capture cannot resolve a discovered check.
+ if (Type == EVASIONS && (target & (pos.ep_square() + Up)))
+ return moveList;
- b1 = pawnsNotOn7 & pos.attacks_from<PAWN>(pos.ep_square(), Them);
+ b1 = pawnsNotOn7 & pawn_attacks_bb(Them, pos.ep_square());
assert(b1);
while (b1)
- (mlist++)->move = make<ENPASSANT>(pop_lsb(&b1), pos.ep_square());
+ *moveList++ = make<EN_PASSANT>(pop_lsb(&b1), pos.ep_square());
}
}
- return mlist;
+ return moveList;
}
- template<PieceType Pt, bool Checks> FORCE_INLINE
- ExtMove* generate_moves(const Position& pos, ExtMove* mlist, Color us,
- Bitboard target, const CheckInfo* ci) {
+ template<PieceType Pt, bool Checks>
+ ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard piecesToMove, Bitboard target) {
- assert(Pt != KING && Pt != PAWN);
+ static_assert(Pt != KING && Pt != PAWN, "Unsupported piece type in generate_moves()");
- const Square* pl = pos.list<Pt>(us);
+ Bitboard bb = piecesToMove & pos.pieces(Pt);
- 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;
+ while (bb) {
+ Square from = pop_lsb(&bb);
- if (unlikely(ci->dcCandidates) && (ci->dcCandidates & from))
- continue;
- }
+ if (Checks && (Pt == BISHOP || Pt == ROOK || Pt == QUEEN)
+ && !(attacks_bb<Pt>(from) & target & pos.check_squares(Pt)))
+ continue;
- Bitboard b = pos.attacks_from<Pt>(from) & target;
+ Bitboard b = attacks_bb<Pt>(from, pos.pieces()) & target;
if (Checks)
- b &= ci->checkSq[Pt];
+ b &= pos.check_squares(Pt);
- SERIALIZE(b);
+ while (b)
+ *moveList++ = make_move(from, pop_lsb(&b));
}
- return mlist;
+ return moveList;
}
- template<Color Us, GenType Type> FORCE_INLINE
- ExtMove* generate_all(const Position& pos, ExtMove* mlist, Bitboard target,
- const CheckInfo* ci = NULL) {
+ template<Color Us, GenType Type>
+ ExtMove* generate_all(const Position& pos, ExtMove* moveList) {
- const bool Checks = Type == QUIET_CHECKS;
+ static_assert(Type != LEGAL, "Unsupported type in generate_all()");
- 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);
+ constexpr bool Checks = Type == QUIET_CHECKS; // Reduce template instantations
+ Bitboard target, piecesToMove = pos.pieces(Us);
- if (Type != QUIET_CHECKS && Type != EVASIONS)
- {
- Square from = pos.king_square(Us);
- Bitboard b = pos.attacks_from<KING>(from) & target;
- SERIALIZE(b);
- }
+ if(Type == QUIET_CHECKS)
+ piecesToMove &= ~pos.blockers_for_king(~Us);
- if (Type != CAPTURES && Type != EVASIONS && pos.can_castle(Us))
+ switch (Type)
{
- if (pos.is_chess960())
+ case CAPTURES:
+ target = pos.pieces(~Us);
+ break;
+ case QUIETS:
+ case QUIET_CHECKS:
+ target = ~pos.pieces();
+ break;
+ case EVASIONS:
{
- 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);
+ Square checksq = lsb(pos.checkers());
+ target = between_bb(pos.square<KING>(Us), checksq) | checksq;
+ break;
}
+ case NON_EVASIONS:
+ target = ~pos.pieces(Us);
+ break;
}
- return mlist;
- }
+ moveList = generate_pawn_moves<Us, Type>(pos, moveList, target);
+ moveList = generate_moves<KNIGHT, Checks>(pos, moveList, piecesToMove, target);
+ moveList = generate_moves<BISHOP, Checks>(pos, moveList, piecesToMove, target);
+ moveList = generate_moves< ROOK, Checks>(pos, moveList, piecesToMove, target);
+ moveList = generate_moves< QUEEN, Checks>(pos, moveList, piecesToMove, target);
+ if (Type != QUIET_CHECKS && Type != EVASIONS)
+ {
+ Square ksq = pos.square<KING>(Us);
+ Bitboard b = attacks_bb<KING>(ksq) & target;
+ while (b)
+ *moveList++ = make_move(ksq, pop_lsb(&b));
+
+ if ((Type != CAPTURES) && 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++ = make<CASTLING>(ksq, pos.castling_rook_square(cr));
+ }
+
+ return moveList;
+ }
} // namespace
-/// 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.
+/// <CAPTURES> Generates all pseudo-legal captures plus queen and checking knight promotions
+/// <QUIETS> Generates all pseudo-legal non-captures and underpromotions(except checking knight)
+/// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
///
-/// generate<NON_EVASIONS> generates all pseudo-legal captures and
-/// non-captures. Returns a pointer to the end of the move list.
+/// Returns a pointer to the end of the move list.
template<GenType Type>
-ExtMove* generate(const Position& pos, ExtMove* mlist) {
+ExtMove* generate(const Position& pos, ExtMove* moveList) {
- assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS);
+ static_assert(Type == CAPTURES || Type == QUIETS || Type == NON_EVASIONS, "Unsupported type in generate()");
assert(!pos.checkers());
Color us = pos.side_to_move();
- Bitboard target = Type == CAPTURES ? pos.pieces(~us)
- : Type == QUIETS ? ~pos.pieces()
- : Type == NON_EVASIONS ? ~pos.pieces(us) : 0;
-
- return us == WHITE ? generate_all<WHITE, Type>(pos, mlist, target)
- : generate_all<BLACK, Type>(pos, mlist, target);
+ return us == WHITE ? generate_all<WHITE, Type>(pos, moveList)
+ : generate_all<BLACK, Type>(pos, moveList);
}
// Explicit template instantiations
template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
-/// 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.
+/// generate<QUIET_CHECKS> generates all pseudo-legal non-captures.
+/// Returns a pointer to the end of the move list.
template<>
-ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* mlist) {
+ExtMove* generate<QUIET_CHECKS>(const Position& pos, ExtMove* moveList) {
assert(!pos.checkers());
Color us = pos.side_to_move();
- CheckInfo ci(pos);
- Bitboard dc = ci.dcCandidates;
+ Bitboard dc = pos.blockers_for_king(~us) & pos.pieces(us) & ~pos.pieces(PAWN);
while (dc)
{
Square from = pop_lsb(&dc);
PieceType pt = type_of(pos.piece_on(from));
- if (pt == PAWN)
- continue; // Will be generated togheter with direct checks
-
- Bitboard b = pos.attacks_from(Piece(pt), from) & ~pos.pieces();
+ Bitboard b = attacks_bb(pt, from, pos.pieces()) & ~pos.pieces();
if (pt == KING)
- b &= ~PseudoAttacks[QUEEN][ci.ksq];
+ b &= ~attacks_bb<QUEEN>(pos.square<KING>(~us));
- SERIALIZE(b);
+ while (b)
+ *moveList++ = make_move(from, pop_lsb(&b));
}
- return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &ci)
- : generate_all<BLACK, QUIET_CHECKS>(pos, mlist, ~pos.pieces(), &ci);
+ return us == WHITE ? generate_all<WHITE, QUIET_CHECKS>(pos, moveList)
+ : generate_all<BLACK, QUIET_CHECKS>(pos, moveList);
}
/// 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) {
+ExtMove* generate<EVASIONS>(const Position& pos, ExtMove* moveList) {
assert(pos.checkers());
- int checkersCnt = 0;
Color us = pos.side_to_move();
- Square ksq = pos.king_square(us), from = ksq /* For SERIALIZE */, checksq;
+ Square ksq = pos.square<KING>(us);
Bitboard sliderAttacks = 0;
- Bitboard b = pos.checkers();
-
- assert(pos.checkers());
+ Bitboard sliders = pos.checkers() & ~pos.pieces(KNIGHT, PAWN);
- // 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);
-
- assert(color_of(pos.piece_on(checksq)) == ~us);
-
- 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);
-
- default:
- break;
- }
- } while (b);
+ // Find all the squares attacked by slider checkers. We will remove them from
+ // the king evasions in order to skip known illegal moves, which avoids any
+ // useless legality checks later on.
+ while (sliders)
+ sliderAttacks |= line_bb(ksq, pop_lsb(&sliders)) & ~pos.checkers();
// Generate evasions for king, capture and non capture moves
- b = pos.attacks_from<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
- SERIALIZE(b);
+ Bitboard b = attacks_bb<KING>(ksq) & ~pos.pieces(us) & ~sliderAttacks;
+ while (b)
+ *moveList++ = make_move(ksq, pop_lsb(&b));
- if (checkersCnt > 1)
- return mlist; // Double check, only a king move can save the day
+ if (more_than_one(pos.checkers()))
+ return moveList; // Double check, only a king move can save the day
// Generate blocking evasions or captures of the checking piece
- Bitboard target = between_bb(checksq, ksq) | checksq;
-
- return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, mlist, target)
- : generate_all<BLACK, EVASIONS>(pos, mlist, target);
+ return us == WHITE ? generate_all<WHITE, EVASIONS>(pos, moveList)
+ : generate_all<BLACK, EVASIONS>(pos, moveList);
}
/// generate<LEGAL> generates all the legal moves in the given position
template<>
-ExtMove* generate<LEGAL>(const Position& pos, ExtMove* mlist) {
-
- ExtMove *end, *cur = mlist;
- Bitboard pinned = pos.pinned_pieces(pos.side_to_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.legal(cur->move, pinned))
- cur->move = (--end)->move;
+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 || from_sq(*cur) == ksq || type_of(*cur) == EN_PASSANT)
+ && !pos.legal(*cur))
+ *cur = (--moveList)->move;
else
++cur;
- return end;
+ return moveList;
}
projects / stockfish / blobdiff