Struct shakmaty::Chess

pub struct Chess { /* fields omitted */ }

A standard Chess position.

Trait Implementations

impl Clone for Chess

fn clone(&self) -> Chess

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Chess

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Default for Chess

fn default() -> Chess

Returns the "default value" for a type.

impl Setup for Chess

fn board(&self) -> &Board

fn pockets(&self) -> Option<&Pockets>

fn turn(&self) -> Color

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn castling_rights(&self) -> Bitboard

fn ep_square(&self) -> Option<Square>

fn remaining_checks(&self) -> Option<&RemainingChecks>

fn halfmove_clock(&self) -> u32

fn fullmoves(&self) -> u32

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn us(&self) -> Bitboard

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn our(&self, role: Role) -> Bitboard

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn them(&self) -> Bitboard

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn their(&self, role: Role) -> Bitboard

impl Position for Chess

fn play_unchecked(&mut self, m: &Move)

Plays a move. It is the callers responsibility to ensure the move is legal.

fn from_setup<S: Setup>(setup: &S) -> Result<Chess, PositionError>

Set up a position.

fn castles(&self) -> &Castles

Castling paths and unmoved rooks.

fn castling_uncovers_rank_attack(&self, rook: Square, king_to: Square) -> bool

Tests the rare case where moving the rook to the other side during castling would uncover a rank attack.

fn legal_moves(&self, moves: &mut MoveList)

Collects all legal moves in an existing buffer.

fn castling_moves(&self, side: CastlingSide, moves: &mut MoveList)

Generates legal castling moves.

fn en_passant_moves(&self, moves: &mut MoveList)

Generates en passant moves.

fn san_candidates(&self, role: Role, to: Square, moves: &mut MoveList)

Generates a subset of legal moves: All piece moves and drops of type role to the square to, excluding castling moves.

fn is_insufficient_material(&self) -> bool

Tests for insufficient winning material.

fn is_variant_end(&self) -> bool

Checks if the game is over due to a special variant end condition.

fn variant_outcome(&self) -> Option<Outcome>

Tests special variant winning, losing and drawing conditions.

fn swap_turn(self) -> Result<Self, PositionError> where     Self: Sized,

Swap turns. This is sometimes called "playing a null move".

fn legals(&self) -> MoveList

Generates legal moves.

fn capture_moves(&self, moves: &mut MoveList)

Generates capture moves.

fn is_legal(&self, m: &Move) -> bool

Tests a move for legality.

fn is_irreversible(&self, m: &Move) -> bool

Tests if a move is irreversible.

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn king_attackers(     &self,     square: Square,     attacker: Color,     occupied: Bitboard ) -> Bitboard

Attacks that a king on square would have to deal with.

fn is_check(&self) -> bool

Tests if the king is in check.

Important traits for Bitboard

impl Iterator for Bitboard type Item = Square;

fn checkers(&self) -> Bitboard

Bitboard of pieces giving check.

fn is_checkmate(&self) -> bool

Tests for checkmate.

fn is_stalemate(&self) -> bool

Tests for stalemate.

fn is_game_over(&self) -> bool

Tests if the game is over due to checkmate, stalemate, insufficient material or variant end.

fn outcome(&self) -> Option<Outcome>

The outcome of the game, or None if the game is not over.

fn play(self, m: &Move) -> Result<Self, IllegalMove> where     Self: Sized,

Plays a move.