Struct myopic_brain::EvalBoard

pub struct EvalBoard<B: ChessBoard> { /* fields omitted */ }

Implementations

impl EvalBoard<Board>

pub fn start() -> EvalBoard<Board>

pub fn builder_fen(fen: &str) -> Result<Builder<Board>>

impl<B> EvalBoard<B> where
    B: ChessBoard, 

pub fn builder(board: B) -> Builder<B>

Trait Implementations

impl<B: ChessBoard> ChessBoard for EvalBoard<B>

fn make(&mut self, action: Move) -> Result<()>

Evolves the position by making the given move. If the source hash of the move does not match the hash of this position (prior to making the move) then an error will be returned. If the hash matches but the move is illegal in this position (e.g if you manually start creating moves) then the results are undefined.

fn unmake(&mut self) -> Result<Move>

Reverses and returns the move which was made last. If no move has been made yet then an error is returned.

fn compute_moves(&mut self, computation_type: MoveComputeType) -> Vec<Move>

Compute a vector of all the legal moves in this position for the given computation type. Note there is no particular ordering to the move vector.

fn termination_status(&mut self) -> Option<Termination>

Compute the termination state of this node. If it is not terminal nothing is returned, if it is then the manner of termination is returned wrapped inside an Option. The termination can be only a draw or a loss since a side only loses when it runs out of moves, i.e. you don’t play a winning move, you just fail to have a legal move.

fn in_check(&mut self) -> bool

Determines whether the active side is in a state of check.

fn side(&self, side: Side) -> BitBoard

Return the locations of all pieces on the given side.

fn sides(&self) -> (BitBoard, BitBoard)

Return the locations of all white and black pieces.

fn hash(&self) -> u64

Returns the Zobrist hash of this position.

fn active(&self) -> Side

Return the active side in this position, i.e. the one whose turn it is.

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

Return the enpassant target square in this position.

fn locs(&self, pieces: &[Piece]) -> BitBoard

Return the locations of the given pieces.

fn king(&self, side: Side) -> Square

Return the location of the king for the given side.

fn piece(&self, location: Square) -> Option<Piece>

Return the piece occupying the given location.

fn half_move_clock(&self) -> usize

Return the half move clock value at this position.

fn position_count(&self) -> usize

Return the number of previous positions for this board.

fn remaining_rights(&self) -> EnumSet<CastleZone>

Return the remaining castling rights from this position.

fn play_pgn(&mut self, moves: &str) -> Result<Vec<Move>>

Parse the given string as a sequence of pgn encoded moves starting from the current position. The moves are then made one by one. The sequence of moves which were made are returned in a Vec.

fn play_uci(&mut self, moves: &str) -> Result<Vec<Move>>

Parse the given string as a sequence of uci encoded moves starting from the current position. The moves are then made one by one.The sequence of moves which were made are returned in a Vec.

fn parse_uci(&mut self, uci_move: &str) -> Result<Move>

Given a uci encoded move this method will attempt to match it to the unique matching legal move in this position if it exist. An error is returned if no matching move exists in this position.

fn to_partial_fen(&self, cmps: &[FenComponent]) -> String

Return the specified components of the FEN encoding of this position in the given order with components separated by a space.

fn to_fen(&self) -> String

Return the complete FEN representation of this position.

fn all_pieces(&self) -> BitBoard

Returns the locations of all pieces on the board.

impl<B: Clone + ChessBoard> Clone for EvalBoard<B>

fn clone(&self) -> EvalBoard<B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<B: ChessBoard> EvalChessBoard for EvalBoard<B>

fn static_eval(&mut self) -> i32

The static evaluation function assigns a score to this exact position at the point of time it is called. It does not take into account potential captures/recaptures etc. It must follow the rule that ‘a higher score is best for the active side’. That is if it is white to move next then a high positive score indicates a favorable position for white and if it is black to move a high positive score indicates a favorable position for black. If the state it terminal it must return the LOSS_VALUE or DRAW_VALUE depending on the type of termination.

fn piece_values(&self) -> &[i32; 6]

The value each piece is considered to have in the current state of the game.

fn positional_eval(&self, piece: Piece, location: Square) -> i32

The positional (table) value of the given piece situated at the given square in the context of this position.