Crate chess_move_gen

Expand description

§chess_move_gen

Provides structs and methods for generating chess moves efficiently

Example usage:

use chess_move_gen::*;
let mut list = MoveVec::new();
let position = &Position::from_fen("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w QqKk - 0 1").unwrap();
legal_moves::<MoveVec>(position, &mut list);
assert_eq!(list.len(), 20);

Ways to store moves:

MoveVec: Wraps a vector of generated moves, useful if you need to access the actual moves being generated MoveCounter: Counts moves of each kind (captures, castles, promotions etc). Useful if you are making a perft function or need statistics about moves for a position, but don’t care about the actual moves SortedMoveAdder + SortedMoveHeap: Stores genarated moves in a sorted binary heap, which are efficiently ordered as they are inserted based on a heuristic scoring and piece-square table that you provide. Use this if you want the moves to have a reasonably good initial ordering so moves that are checked first are more likely to lead to eg alpha-beta cutoffs and reduce the search tree size.

Re-exports§

pub use crate::bb::BB;

Modules§

bb

Structs§

Board
Castle: Represents a castleove
CastlingRights: Represents the right to castle in a particular director for a particular side
Kind: Represents a kind of piece (eg knight)
KindsIter
Move: Represents a move on the chess position. Uses a compact 16 bit representation
MoveCounter: MoveCounter implements MoveAdder and keeps a count of different types of moves added to it.
MoveGenPreprocessing: Contains data about checkers, pinned pieces, and pinners
MoveScore: MoveScore encodes a move and the piece-square score change that the move creates
MoveVec: MoveVec implements MoveAdder and collects moves in a vector. Use iter to access the moves once they have been added.
Piece: Represents a piece for a particular side (eg black knight)
PieceSquareTable: PieceSquareTable gives scores for pieces on squares from the perspective of white. See https://www.chessprogramming.org/Piece-Square_Tables
PiecesIter
Position: Position encodes all positional information and non-positional game state
Side: Represents a side to move
SortedMoveAdder: SortedMoveAdder collects moves including the piece-square score for making the move Moves are sorted by an ‘ordering score’ and stored in a provided SortedMoveHeap
SortedMoveHeap
SortedMoveHeapItem
Square: Represents a square on the chessboard
SquaresIter
State: State encodes all game state except position

Constants§

Traits§

MoveAdder: MoveAdder represents a way to collect moves from move generation functions Implementations: MoveCounter (count moves only) MoveVec (adds move to Vec) SortedMoveAdder (adds moves along with piece-square-scores to a sorted binary heap)

Functions§

legal_moves: Adds all legal moves to the provided MoveAdder. Returns true if mover is in check
legal_moves_with_preprocessing: Adds all legal moves to the provided MoveAdder. Returns true if moving side is in check
loud_legal_moves: Adds ‘loud’ legal moves to the move list. Returns true if moving side is in check
loud_legal_moves_with_preprocessing
movegen_preprocessing: Generates data about checkers, pinned pieces and pinners to be used by legal_moves_with_preprocessing()
perft: Returns the number of nodes at the provided depth cache_bytes_per_thread must be of form 2^N bytes if multi_threading_enabled is set to true search will run concurrently accross threads equal to your CPU count
perft_detailed: Returns the number of moves, captures, promotions, castles and en-passant captures at the provided depth if multi_threading_enabled is set to true search will run concurrently accross threads equal to your CPU count

Type Aliases§

SquareInternal