- 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;
-
- Bitboard target = squares_between(checksq, ksq);
-
- // Pawn captures
- b = pos.attacks_from<PAWN>(checksq, them) & pos.pieces(PAWN, us) & ~pinned;
- while (b)
- {
- from = pop_1st_bit(&b);
- if (relative_rank(us, checksq) == RANK_8)
- {
- (*mlist++).move = make_promotion_move(from, checksq, QUEEN);
- (*mlist++).move = make_promotion_move(from, checksq, ROOK);
- (*mlist++).move = make_promotion_move(from, checksq, BISHOP);
- (*mlist++).move = make_promotion_move(from, checksq, KNIGHT);
- } else
- (*mlist++).move = make_move(from, checksq);
- }
-
- // Pawn blocking evasions (possible only if the checking piece is a slider)
- if (sliderAttacks)
- mlist = generate_piece_evasions<PAWN>(pos, mlist, us, target, pinned);
-
- // Add the checking piece to the target squares
- target |= checkers;
-
- // Captures and blocking evasions for the other pieces
- 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);
-
- // Finally, the special case of en passant captures. An en passant
- // capture can only be a check evasion if the check is not a discovered
- // check. If pos.ep_square() is set, the last move made must have been
- // a double pawn push. If, furthermore, the checking piece is a pawn,
- // an en passant check evasion may be possible.
- if (pos.ep_square() != SQ_NONE && (checkers & pos.pieces(PAWN, them)))
- {
- to = pos.ep_square();
- b = pos.attacks_from<PAWN>(to, them) & pos.pieces(PAWN, us);
-
- // The checking pawn cannot be a discovered (bishop) check candidate
- // otherwise we were in check also before last double push move.
- assert(!bit_is_set(pos.discovered_check_candidates(them), checksq));
- assert(count_1s(b) == 1 || count_1s(b) == 2);
-
- b &= ~pinned;
- while (b)
- {
- from = pop_1st_bit(&b);
- // Move is always legal because checking pawn is not a discovered
- // check candidate and our capturing pawn has been already tested
- // against pinned pieces.
- (*mlist++).move = make_ep_move(from, to);
- }
- }
- return mlist;
-}
-
-
-/// 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) {