- 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, 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) {
-
- assert(pos.is_ok());
-
- MoveStack *last, *cur = mlist;
- Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
-
- // Generate pseudo-legal moves
- last = pos.is_check() ? generate_evasions(pos, mlist)
- : generate_non_evasions(pos, mlist);
- if (pseudoLegal)
- return last;
-
- // Remove illegal moves from the list
- while (cur != last)
- if (pos.pl_move_is_legal(cur->move, pinned))
- cur++;
- else
- cur->move = (--last)->move;
-
- return last;
-}
-
-
-/// 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.
-
-bool move_is_legal(const Position& pos, const Move m) {
-
- MoveStack mlist[MOVES_MAX];
- MoveStack *cur, *last = generate_moves(pos, mlist, true);
-
- for (cur = mlist; cur != last; cur++)
- if (cur->move == m)
- return pos.pl_move_is_legal(m, pos.pinned_pieces(pos.side_to_move()));
-
- return false;
-}