timecat 1.52.0

use super::*;

trait PieceMoves {
    fn is(piece: PieceType) -> bool;
    fn into_piece() -> PieceType;
    fn pseudo_legals(src: Square, color: Color, occupied: BitBoard, mask: BitBoard) -> BitBoard;
    fn legals<T>(move_list: &mut MoveList, position: &ChessPosition, mask: BitBoard)
    where
        T: CheckMoves,
    {
        let occupied = position.occupied();
        let color = position.turn();
        let ksq = position.get_king_square(color);

        let pieces = position.get_colored_piece_mask(Self::into_piece(), color);
        let pinned = position.pinned();
        let checkers = position.get_checkers();

        let check_mask = if T::IN_CHECK {
            unsafe { checkers.to_square_unchecked() }.between(ksq) ^ checkers
        } else {
            BitBoard::ALL
        };

        for src in pieces & !pinned {
            let square_and_bitboard_array =
                Self::pseudo_legals(src, color, occupied, mask) & check_mask;
            if !square_and_bitboard_array.is_empty() {
                unsafe {
                    move_list.push_unchecked(SquareAndBitBoard::new(
                        src,
                        square_and_bitboard_array,
                        false,
                    ));
                }
            }
        }

        if !T::IN_CHECK {
            for src in pieces & pinned {
                let square_and_bitboard_array =
                    Self::pseudo_legals(src, color, occupied, mask) & src.line(ksq);
                if !square_and_bitboard_array.is_empty() {
                    unsafe {
                        move_list.push_unchecked(SquareAndBitBoard::new(
                            src,
                            square_and_bitboard_array,
                            false,
                        ));
                    }
                }
            }
        }
    }
}

struct PawnMoves;
struct BishopMoves;
struct KnightMoves;
struct RookMoves;
struct QueenMoves;
struct KingMoves;

trait CheckMoves {
    const IN_CHECK: bool;
}

struct InCheckMoves;
struct NotInCheckMoves;

impl CheckMoves for InCheckMoves {
    const IN_CHECK: bool = true;
}

impl CheckMoves for NotInCheckMoves {
    const IN_CHECK: bool = false;
}

impl PawnMoves {
    fn legal_ep_move(position: &ChessPosition, source: Square, dest: Square) -> bool {
        let Some(ep_square) = position.ep_square() else {
            return false;
        };

        let occupied = position.occupied()
            ^ ep_square.wrapping_backward(position.turn()).to_bitboard()
            ^ source.to_bitboard()
            ^ dest.to_bitboard();

        let ksq = unsafe {
            (position.get_colored_piece_mask(King, position.turn())).to_square_unchecked()
        };

        let rooks = (position.get_piece_mask(Rook) ^ position.get_piece_mask(Queen))
            & position.opponent_occupied();

        if !(ksq.get_rook_rays_bb() & rooks).is_empty()
            && !(ksq.get_rook_moves(occupied) & rooks).is_empty()
        {
            return false;
        }

        let bishops = (position.get_piece_mask(Bishop) ^ position.get_piece_mask(Queen))
            & position.opponent_occupied();

        if !(ksq.get_bishop_rays_bb() & bishops).is_empty()
            && !(ksq.get_bishop_moves(occupied) & bishops).is_empty()
        {
            return false;
        }

        true
    }
}

impl PieceMoves for PawnMoves {
    fn is(piece: PieceType) -> bool {
        piece == Pawn
    }

    fn into_piece() -> PieceType {
        Pawn
    }

    #[inline]
    fn pseudo_legals(src: Square, color: Color, occupied: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_pawn_moves(color, occupied) & mask
    }

    #[inline]
    fn legals<T>(move_list: &mut MoveList, position: &ChessPosition, mask: BitBoard)
    where
        T: CheckMoves,
    {
        let occupied = position.occupied();
        let color = position.turn();
        let ksq = position.get_king_square(color);

        let pieces = position.get_colored_piece_mask(Self::into_piece(), color);
        let pinned = position.pinned();
        let checkers = position.get_checkers();

        let check_mask = if T::IN_CHECK {
            unsafe { checkers.to_square_unchecked() }.between(ksq) ^ checkers
        } else {
            BitBoard::ALL
        };

        for src in pieces & !pinned {
            let square_and_bitboard_array =
                Self::pseudo_legals(src, color, occupied, mask) & check_mask;
            if !square_and_bitboard_array.is_empty() {
                unsafe {
                    move_list.push_unchecked(SquareAndBitBoard::new(
                        src,
                        square_and_bitboard_array,
                        src.get_rank() == color.to_seventh_rank(),
                    ));
                }
            }
        }

        if !T::IN_CHECK {
            for src in pieces & pinned {
                let square_and_bitboard_array =
                    Self::pseudo_legals(src, color, occupied, mask) & ksq.line(src);
                if !square_and_bitboard_array.is_empty() {
                    unsafe {
                        move_list.push_unchecked(SquareAndBitBoard::new(
                            src,
                            square_and_bitboard_array,
                            src.get_rank() == color.to_seventh_rank(),
                        ));
                    }
                }
            }
        }

        if let Some(dest) = position.ep_square() {
            let dest_rank = dest.get_rank();
            let rank_bb = if dest_rank.to_int() > 3 {
                dest_rank.wrapping_down().to_bitboard()
            } else {
                dest_rank.wrapping_up().to_bitboard()
            };
            let files_bb = dest.get_file().get_adjacent_files_bb();
            for src in rank_bb & files_bb & pieces {
                if Self::legal_ep_move(position, src, dest) {
                    unsafe {
                        move_list.push_unchecked(SquareAndBitBoard::new(
                            src,
                            dest.to_bitboard(),
                            false,
                        ));
                    }
                }
            }
        }
    }
}

impl PieceMoves for BishopMoves {
    fn is(piece: PieceType) -> bool {
        piece == Bishop
    }

    fn into_piece() -> PieceType {
        Bishop
    }

    #[inline]
    fn pseudo_legals(src: Square, _: Color, occupied: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_bishop_moves(occupied) & mask
    }
}

impl PieceMoves for KnightMoves {
    fn is(piece: PieceType) -> bool {
        piece == Knight
    }

    fn into_piece() -> PieceType {
        Knight
    }

    #[inline]
    fn pseudo_legals(src: Square, _: Color, _: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_knight_moves() & mask
    }

    #[inline]
    fn legals<T>(move_list: &mut MoveList, position: &ChessPosition, mask: BitBoard)
    where
        T: CheckMoves,
    {
        let occupied = position.occupied();
        let color = position.turn();
        let ksq = position.get_king_square(color);

        let pieces = position.get_colored_piece_mask(Self::into_piece(), color);
        let pinned = position.pinned();
        let checkers = position.get_checkers();

        if T::IN_CHECK {
            let check_mask = unsafe { checkers.to_square_unchecked() }.between(ksq) ^ checkers;

            for src in pieces & !pinned {
                let square_and_bitboard_array =
                    Self::pseudo_legals(src, color, occupied, mask & check_mask);
                if !square_and_bitboard_array.is_empty() {
                    unsafe {
                        move_list.push_unchecked(SquareAndBitBoard::new(
                            src,
                            square_and_bitboard_array,
                            false,
                        ));
                    }
                }
            }
        } else {
            for src in pieces & !pinned {
                let square_and_bitboard_array = Self::pseudo_legals(src, color, occupied, mask);
                if !square_and_bitboard_array.is_empty() {
                    unsafe {
                        move_list.push_unchecked(SquareAndBitBoard::new(
                            src,
                            square_and_bitboard_array,
                            false,
                        ));
                    }
                }
            }
        };
    }
}

impl PieceMoves for RookMoves {
    fn is(piece: PieceType) -> bool {
        piece == Rook
    }

    fn into_piece() -> PieceType {
        Rook
    }

    #[inline]
    fn pseudo_legals(src: Square, _: Color, occupied: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_rook_moves(occupied) & mask
    }
}

impl PieceMoves for QueenMoves {
    fn is(piece: PieceType) -> bool {
        piece == Queen
    }

    fn into_piece() -> PieceType {
        Queen
    }

    #[inline]
    fn pseudo_legals(src: Square, _: Color, occupied: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_queen_moves(occupied) & mask
    }
}

impl KingMoves {
    #[inline]
    fn legal_king_move(position: &ChessPosition, dest: Square) -> bool {
        let occupied = position.occupied() ^ position.get_colored_piece_mask(King, position.turn())
            | dest.to_bitboard();

        let rooks = (position.get_piece_mask(Rook) ^ position.get_piece_mask(Queen))
            & position.opponent_occupied();

        let mut attackers = dest.get_rook_moves(occupied) & rooks;

        let bishops = (position.get_piece_mask(Bishop) ^ position.get_piece_mask(Queen))
            & position.opponent_occupied();

        attackers |= dest.get_bishop_moves(occupied) & bishops;

        let knight_rays = dest.get_knight_moves();

        // Using ^ because knight square_and_bitboard_array bitboard do not collide with rook and bishop square_and_bitboard_array bitboard
        attackers ^= knight_rays & position.get_colored_piece_mask(Knight, !position.turn());
        attackers |=
            dest.get_king_moves() & position.get_colored_piece_mask(King, !position.turn());
        attackers |= dest.get_pawn_attacks(
            position.turn(),
            position.get_colored_piece_mask(Pawn, !position.turn()),
        );

        attackers.is_empty()
    }
}

impl PieceMoves for KingMoves {
    fn is(piece: PieceType) -> bool {
        piece == King
    }

    fn into_piece() -> PieceType {
        King
    }

    #[inline]
    fn pseudo_legals(src: Square, _: Color, _: BitBoard, mask: BitBoard) -> BitBoard {
        src.get_king_moves() & mask
    }

    #[inline]
    fn legals<T>(move_list: &mut MoveList, position: &ChessPosition, mask: BitBoard)
    where
        T: CheckMoves,
    {
        let occupied = position.occupied();
        let color = position.turn();
        let ksq = position.get_king_square(color);

        let mut square_and_bitboard_array = Self::pseudo_legals(ksq, color, occupied, mask);

        let copy = square_and_bitboard_array;
        for dest in copy {
            if !Self::legal_king_move(position, dest) {
                square_and_bitboard_array ^= dest.to_bitboard();
            }
        }

        // If we are not in check, we may be able to castle.
        // We can do so iff:
        //  * the `ChessPosition` structure says we can.
        //  * the squares between my king and my rook are empty.
        //  * no enemy pieces are attacking the squares between the king, and the kings
        //    destination square.
        //  ** This is determined by going to the left or right, and calling
        //     'legal_king_move' for that square.
        if !T::IN_CHECK {
            if position.my_castle_rights().has_kingside()
                && (occupied & position.my_castle_rights().kingside_squares(color)).is_empty()
            {
                let middle = ksq.wrapping_right();
                let right = middle.wrapping_right();
                if Self::legal_king_move(position, middle) && Self::legal_king_move(position, right)
                {
                    square_and_bitboard_array ^= right.to_bitboard();
                }
            }

            if position.my_castle_rights().has_queenside()
                && (occupied & position.my_castle_rights().queenside_squares(color)).is_empty()
            {
                let middle = ksq.wrapping_left();
                let left = middle.wrapping_left();
                if Self::legal_king_move(position, middle) && Self::legal_king_move(position, left)
                {
                    square_and_bitboard_array ^= left.to_bitboard();
                }
            }
        }
        if !square_and_bitboard_array.is_empty() {
            unsafe {
                move_list.push_unchecked(SquareAndBitBoard::new(
                    ksq,
                    square_and_bitboard_array,
                    false,
                ));
            }
        }
    }
}

#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[derive(Clone, PartialEq, Eq, Debug)]
struct SquareAndBitBoard {
    square: Square,
    bitboard: BitBoard,
    promotion: bool,
}

impl SquareAndBitBoard {
    fn new(square: Square, bb: BitBoard, promotion: bool) -> Self {
        Self {
            square,
            bitboard: bb,
            promotion,
        }
    }
}

type MoveList = ArrayVec<SquareAndBitBoard, 18>;

#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[derive(Clone, Debug)]
pub struct MoveGenerator {
    square_and_bitboard_array: MoveList,
    promotion_index: usize,
    from_bitboard_iterator_mask: BitBoard,
    to_bitboard_iterator_mask: BitBoard,
}

impl MoveGenerator {
    #[inline]
    fn enumerate_moves(position: &ChessPosition) -> MoveList {
        let checkers = position.get_checkers();
        let mask = !position.self_occupied();
        let mut move_list = ArrayVec::new();

        if checkers.is_empty() {
            PawnMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
            KnightMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
            BishopMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
            RookMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
            QueenMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
            KingMoves::legals::<NotInCheckMoves>(&mut move_list, position, mask);
        } else if checkers.popcnt() == 1 {
            PawnMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            KnightMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            BishopMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            RookMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            QueenMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            KingMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
        } else {
            KingMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
        }

        move_list
    }

    #[inline]
    pub fn get_single_legal_move(
        position: &ChessPosition,
        from_bitboard: BitBoard,
        to_bitboard: BitBoard,
    ) -> Option<Move> {
        let checkers = position.get_checkers();
        let mask = !position.self_occupied() & to_bitboard;
        let mut move_list = ArrayVec::new();

        let legal_functions = if checkers.is_empty() {
            [
                PawnMoves::legals::<NotInCheckMoves>,
                KnightMoves::legals::<NotInCheckMoves>,
                BishopMoves::legals::<NotInCheckMoves>,
                RookMoves::legals::<NotInCheckMoves>,
                QueenMoves::legals::<NotInCheckMoves>,
                KingMoves::legals::<NotInCheckMoves>,
            ]
        } else if checkers.popcnt() == 1 {
            [
                PawnMoves::legals::<InCheckMoves>,
                KnightMoves::legals::<InCheckMoves>,
                BishopMoves::legals::<InCheckMoves>,
                RookMoves::legals::<InCheckMoves>,
                QueenMoves::legals::<InCheckMoves>,
                KingMoves::legals::<InCheckMoves>,
            ]
        } else {
            KingMoves::legals::<InCheckMoves>(&mut move_list, position, mask);
            return move_list.into_iter().find_map(|square_and_bitboard| {
                (from_bitboard.contains(square_and_bitboard.square)
                    && !(square_and_bitboard.bitboard & to_bitboard).is_empty())
                .then(|| unsafe {
                    Move::new_unchecked(
                        square_and_bitboard.square,
                        square_and_bitboard.bitboard.to_square_unchecked(),
                        square_and_bitboard.promotion.then_some(Queen),
                    )
                })
            });
        };

        let mut start_index = 0;

        for function in legal_functions {
            function(&mut move_list, position, mask);
            for square_and_bitboard in &move_list[start_index..] {
                if from_bitboard.contains(square_and_bitboard.square)
                    && !(square_and_bitboard.bitboard & to_bitboard).is_empty()
                {
                    return Some(unsafe {
                        Move::new_unchecked(
                            square_and_bitboard.square,
                            square_and_bitboard.bitboard.to_square_unchecked(),
                            square_and_bitboard.promotion.then_some(Queen),
                        )
                    });
                }
            }
            start_index = move_list.len();
        }

        None
    }

    #[inline]
    pub fn has_legal_moves(
        position: &ChessPosition,
        from_bitboard: BitBoard,
        to_bitboard: BitBoard,
    ) -> bool {
        Self::get_single_legal_move(position, from_bitboard, to_bitboard).is_some()
    }

    #[inline]
    pub fn new_legal(position: &ChessPosition) -> Self {
        Self {
            square_and_bitboard_array: Self::enumerate_moves(position),
            promotion_index: 0,
            from_bitboard_iterator_mask: BitBoard::ALL,
            to_bitboard_iterator_mask: BitBoard::ALL,
        }
    }

    /// The iterator portion of this struct relies on the invariant that
    /// the bitboards at the beginning of the square_and_bitboard_array[] array are the only
    /// ones used.  As a result, we must partition the list such that the
    /// assumption is true.
    pub fn reorganize_square_and_bitboard_array(&mut self) {
        // first, find the first non-used square_and_bitboard_array index, and store that in i
        let mut i = 0;
        while i < self.square_and_bitboard_array.len()
            && !(get_item_unchecked!(self.square_and_bitboard_array, i).bitboard
                & self.to_bitboard_iterator_mask)
                .is_empty()
        {
            i += 1;
        }

        // next, find each element past i where the square_and_bitboard_array are used, and store
        // that in i.  Then, increment i to point to a new unused slot.
        for j in (i + 1)..self.square_and_bitboard_array.len() {
            if !(get_item_unchecked!(self.square_and_bitboard_array, j).bitboard
                & self.to_bitboard_iterator_mask)
                .is_empty()
            {
                // unsafe { self.square_and_bitboard_array.swap_unchecked(i, j) };
                self.square_and_bitboard_array.swap(i, j);
                i += 1;
            }
        }
    }

    pub fn remove_mask(&mut self, mask: BitBoard) {
        self.square_and_bitboard_array
            .iter_mut()
            .for_each(|square_and_bitboard| square_and_bitboard.bitboard &= !mask);
        self.reorganize_square_and_bitboard_array();
    }

    pub fn remove_move(&mut self, move_: Move) -> bool {
        let mut square_removed = false;
        for square_and_bitboard in self.square_and_bitboard_array.iter_mut() {
            if square_and_bitboard.square == move_.get_source() {
                square_and_bitboard.bitboard &= !move_.get_dest().to_bitboard();
                square_removed = true;
            }
        }
        self.reorganize_square_and_bitboard_array();
        square_removed
    }

    pub fn get_from_bitboard_iterator_mask(&self) -> BitBoard {
        self.from_bitboard_iterator_mask
    }

    pub fn set_from_bitboard_iterator_mask(&mut self, mask: BitBoard) {
        self.from_bitboard_iterator_mask = mask;
        self.reorganize_square_and_bitboard_array();
    }

    pub fn get_to_bitboard_iterator_mask(&self) -> BitBoard {
        self.to_bitboard_iterator_mask
    }

    pub fn set_to_bitboard_iterator_mask(&mut self, mask: BitBoard) {
        self.to_bitboard_iterator_mask = mask;
        self.reorganize_square_and_bitboard_array();
    }

    pub fn set_iterator_masks(&mut self, from_bitboard: BitBoard, to_bitboard: BitBoard) {
        self.from_bitboard_iterator_mask = from_bitboard;
        self.to_bitboard_iterator_mask = to_bitboard;
        self.reorganize_square_and_bitboard_array();
    }

    pub fn perft_test(position: &ChessPosition, depth: usize) -> usize {
        let iterable = position.generate_legal_moves();

        let mut result: usize = 0;
        if depth == 1 {
            iterable.len()
        } else {
            for m in iterable {
                let board_result = position.make_move_new(m);
                result += Self::perft_test(&board_result, depth - 1);
            }
            result
        }
    }

    pub fn perft_test_piecewise(position: &ChessPosition, depth: usize) -> usize {
        let mut iterable = position.generate_legal_moves();

        let targets = position.opponent_occupied();
        let mut result: usize = 0;

        for &piece_mask in position.get_all_piece_masks() {
            iterable.set_from_bitboard_iterator_mask(piece_mask);
            iterable.set_to_bitboard_iterator_mask(targets);
            if depth == 1 {
                result += iterable.len();
                iterable.set_to_bitboard_iterator_mask(!targets);
                result += iterable.len();
            } else {
                for x in &iterable {
                    result += Self::perft_test(&position.make_move_new(x), depth - 1);
                }
                iterable.set_to_bitboard_iterator_mask(!targets);
                for x in &iterable {
                    result += Self::perft_test(&position.make_move_new(x), depth - 1);
                }
            }
        }
        result
    }

    #[inline]
    pub fn iter(&self) -> impl Iterator<Item = Move> {
        let iterator = self
            .square_and_bitboard_array
            .iter()
            .take_while(|square_and_bitboard| {
                !(square_and_bitboard.bitboard & self.to_bitboard_iterator_mask).is_empty()
            })
            .filter(|square_and_bitboard| {
                self.from_bitboard_iterator_mask
                    .contains(square_and_bitboard.square)
            })
            .flat_map(move |square_and_bitboard| {
                let promotion_pieces: &[Option<PieceType>] = if square_and_bitboard.promotion {
                    const { &[Some(Queen), Some(Knight), Some(Rook), Some(Bishop)] }
                } else {
                    const { &[None] }
                };
                promotion_pieces.iter().flat_map(move |&promotion| {
                    (square_and_bitboard.bitboard & self.to_bitboard_iterator_mask).map(
                        move |dest| unsafe {
                            Move::new_unchecked(square_and_bitboard.square, dest, promotion)
                        },
                    )
                })
            });

        MoveGeneratorReferencedIterator {
            move_generator: self,
            iterator,
        }
    }

    pub fn len(&self) -> usize {
        let mut result = 0;
        for square_and_bitboard in &self.square_and_bitboard_array {
            let bitboard_and_to_bitboard_iterator_mask =
                square_and_bitboard.bitboard & self.to_bitboard_iterator_mask;
            if !self
                .from_bitboard_iterator_mask
                .contains(square_and_bitboard.square)
                || bitboard_and_to_bitboard_iterator_mask.is_empty()
            {
                break;
            }
            if square_and_bitboard.promotion {
                result += (bitboard_and_to_bitboard_iterator_mask.popcnt() as usize)
                    * NUM_PROMOTION_PIECES;
            } else {
                result += bitboard_and_to_bitboard_iterator_mask.popcnt() as usize;
            }
        }
        result
    }

    #[inline]
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    #[inline]
    pub fn contains(&self, move_: &Move) -> bool {
        self.square_and_bitboard_array
            .iter()
            .any(|square_and_bitboard| {
                square_and_bitboard.square == move_.get_source()
                    && square_and_bitboard.bitboard.contains(move_.get_dest())
                    && if square_and_bitboard.promotion {
                        // TODO: How about Binary Search here?
                        const { [Some(Knight), Some(Bishop), Some(Rook), Some(Queen)] }
                            .contains(&move_.get_promotion())
                    } else {
                        move_.get_promotion().is_none()
                    }
            })
    }

    #[inline]
    pub fn is_legal(position: &ChessPosition, move_: &Move) -> bool {
        // TODO: Scope of improvement
        let Some(piece_type) = position.get_piece_type_at(move_.get_source()) else {
            return false;
        };
        let possibly_legal = match piece_type {
            Pawn => {
                if move_.get_source().get_file() != move_.get_dest().get_file()
                    && position.get_piece_type_at(move_.get_dest()).is_none()
                {
                    // en-passant
                    PawnMoves::legal_ep_move(position, move_.get_source(), move_.get_dest())
                } else {
                    true
                }
            }
            King => {
                let bb = move_.get_source().between(move_.get_dest());
                if bb.popcnt() == 1 {
                    // castles
                    if !KingMoves::legal_king_move(position, unsafe { bb.to_square_unchecked() }) {
                        false
                    } else {
                        KingMoves::legal_king_move(position, move_.get_dest())
                    }
                } else {
                    KingMoves::legal_king_move(position, move_.get_dest())
                }
            }
            _ => true,
        };
        if !possibly_legal {
            return false;
        }
        position.generate_legal_moves().contains(move_)
    }
}

pub struct MoveGeneratorReferencedIterator<'a, T: Iterator<Item = Move>> {
    move_generator: &'a MoveGenerator,
    iterator: T,
}

impl<T: Iterator<Item = Move>> ExactSizeIterator for MoveGeneratorReferencedIterator<'_, T> {
    #[inline]
    fn len(&self) -> usize {
        self.move_generator.len()
    }
}

impl<T: Iterator<Item = Move>> Iterator for MoveGeneratorReferencedIterator<'_, T> {
    type Item = Move;

    fn size_hint(&self) -> (usize, Option<usize>) {
        let len = self.len();
        (len, Some(len))
    }

    fn next(&mut self) -> Option<Move> {
        self.iterator.next()
    }
}

impl<'a> IntoIterator for &'a MoveGenerator {
    type Item = Move;
    // TODO: Avoid Heap Allocation.
    type IntoIter = Box<dyn Iterator<Item = Move> + 'a>;

    fn into_iter(self) -> Self::IntoIter {
        Box::new(self.iter())
    }
}

pub struct MoveGeneratorIterator {
    move_generator: MoveGenerator,
    index: usize,
    last_index: usize,
}

impl Iterator for MoveGeneratorIterator {
    type Item = Move;

    fn size_hint(&self) -> (usize, Option<usize>) {
        let len = self.move_generator.len();
        (len, Some(len))
    }

    fn next(&mut self) -> Option<Move> {
        // TODO: Check Logic
        let square_and_bitboard_array_len = self.move_generator.square_and_bitboard_array.len();
        if self.index >= square_and_bitboard_array_len {
            return None;
        }
        if self.index != self.last_index {
            while !self.move_generator.from_bitboard_iterator_mask.contains(
                get_item_unchecked_mut!(self.move_generator.square_and_bitboard_array, self.index)
                    .square,
            ) {
                self.index += 1;
                if self.index >= square_and_bitboard_array_len {
                    return None;
                }
            }
            self.last_index = self.index;
        }
        let square_and_bitboard =
            get_item_unchecked_mut!(self.move_generator.square_and_bitboard_array, self.index);

        if !self
            .move_generator
            .from_bitboard_iterator_mask
            .contains(square_and_bitboard.square)
            || (square_and_bitboard.bitboard & self.move_generator.to_bitboard_iterator_mask)
                .is_empty()
        {
            // are we done?
            None
        } else if square_and_bitboard.promotion {
            let dest = unsafe {
                (square_and_bitboard.bitboard & self.move_generator.to_bitboard_iterator_mask)
                    .to_square_unchecked()
            };

            // deal with potential promotions for this pawn
            let result = unsafe {
                Move::new_unchecked(
                    square_and_bitboard.square,
                    dest,
                    Some(*get_item_unchecked!(
                        @internal
                        PROMOTION_PIECES,
                        self.move_generator.promotion_index
                    )),
                )
            };
            self.move_generator.promotion_index += 1;
            if self.move_generator.promotion_index >= NUM_PROMOTION_PIECES {
                square_and_bitboard.bitboard ^= dest.to_bitboard();
                self.move_generator.promotion_index = 0;
                if (square_and_bitboard.bitboard & self.move_generator.to_bitboard_iterator_mask)
                    .is_empty()
                {
                    self.index += 1;
                }
            }
            Some(result)
        } else {
            // not a promotion move, so its a 'normal' move as far as this function is concerned
            let dest = unsafe {
                (square_and_bitboard.bitboard & self.move_generator.to_bitboard_iterator_mask)
                    .to_square_unchecked()
            };

            square_and_bitboard.bitboard ^= dest.to_bitboard();
            if (square_and_bitboard.bitboard & self.move_generator.to_bitboard_iterator_mask)
                .is_empty()
            {
                self.index += 1;
            }
            Some(unsafe { Move::new_unchecked(square_and_bitboard.square, dest, None) })
        }
    }
}

impl ExactSizeIterator for MoveGeneratorIterator {
    #[inline]
    fn len(&self) -> usize {
        self.move_generator.len()
    }
}

impl IntoIterator for MoveGenerator {
    type Item = Move;
    type IntoIter = MoveGeneratorIterator;

    fn into_iter(self) -> Self::IntoIter {
        MoveGeneratorIterator {
            move_generator: self,
            index: 0,
            last_index: usize::MAX,
        }
    }
}