Struct chess_move_gen::SortedMoveList

pub struct SortedMoveList<'a> { /* fields omitted */ }

SortedMoveList is list move vec but calculates the piece-square score of each move as it adds them to the list This is more efficient than sorting scores later if you need the moves to be sorted according to piece-square score. Underlying structure is a binary heap which allows O(1) insertion and fast ordered interation via into_iter()

Implementations

impl<'a> SortedMoveList<'a>

pub fn new(
    piece_square_table: &'a PieceSquareTable,
    piece_grid: &'a [Piece; 64],
    stm: Side,
    moves: &'a mut BinaryHeap<MoveScore>
) -> SortedMoveList<'a>

pub fn best_move(&self) -> Option<&MoveScore>

pub fn len(&self) -> usize

Trait Implementations

impl<'a> Debug for SortedMoveList<'a>

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Display for SortedMoveList<'a>

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> MoveList for SortedMoveList<'a>

pub fn add_captures(&mut self, from: Square, targets: BB)

pub fn add_non_captures(&mut self, from: Square, targets: BB)

pub fn add_castle(&mut self, castle: Castle)

Adds the castle to the move list

pub fn add_pawn_ep_capture(&mut self, from: Square, to: Square)

Adds pawn en-passant capture to list. From and to are the squares the moving pieces moves from and to, respectively

pub fn add_pawn_pushes(&mut self, shift: usize, targets: BB)

Adds pawn non-captures to the list. Targets is a bitboard of valid to-squares. Shift is the distance the pawn moved to get to the target square, mod 64. For example, for a white piece moving forward one row this is '8'. For a black piece moving forward one row this is 56 (-8 % 64).

pub fn add_pawn_captures(&mut self, shift: usize, targets: BB)

Adds pawn captures to list. Targets and shift are same as for add_pawn_pushes. Do not use this for en-passant captures (use add_pawn_ep_capture)