Struct Board 

pub struct Board {
    pub turn: Team,
    pub state: State,
}

The main game board combining piece positions and current turn.

Fields

turn: Team

The current team’s turn.

state: State

The state of the board.

Implementations

impl Board

pub fn actions(&self) -> Vec<Action>

Computes the valid actions of the board.

pub fn actions_into(&self, actions: &mut Vec<Action>)

Computes the valid actions and stores them in the provided Vec.

The Vec is cleared before adding actions. This allows callers to reuse a Vec across multiple calls without manual clearing.

pub fn count_actions(&self, scratch: &mut Vec<Action>) -> u64

Counts the number of valid actions using the provided scratch buffer.

This is faster than actions_into when you only need the count, particularly useful for bulk leaf counting in perft at depth 1. Returns 0 for terminal positions (no actions available).

impl Board

pub const fn new(turn: Team, state: State) -> Self

Creates a new board.

pub const fn new_default() -> Self

Creates a new board with default configuration.

pub const fn from_squares( turn: Team, white_squares: &[Square], black_squares: &[Square], king_squares: &[Square], ) -> Self

Creates a new board from the given squares.

pub const fn friendly_pieces(&self) -> u64

Returns the friendly pieces.

pub const fn hostile_pieces(&self) -> u64

Returns the hostile pieces.

pub const fn swap_turn_(&mut self)

Swaps the player’s turn in-place.

pub fn swap_turn(&self) -> Self

Swaps the player’s turn and returns the new board.

pub fn apply_(&mut self, action: &Action)

Applies the given action to the board in-place.

pub fn apply(&self, action: &Action) -> Self

Applies the given action to the board and returns the new board.

pub fn rotate_(&mut self)

Rotates the board by 180 degrees in-place.

pub fn rotate(&self) -> Self

Rotates the board by 180 degrees and returns the new board.

pub fn status(&self) -> GameStatus

Computes the status of the board.

impl Board

pub fn perft(&self, depth: u64) -> u64

Perft (performance test) - counts leaf nodes at a given depth.

This is the standard metric for verifying move generation correctness. Each unique position at the target depth is counted exactly once.

Example

use kish::Board;

let board = Board::new_default();
let nodes = board.perft(3);
println!("Positions at depth 3: {}", nodes);

pub fn perft_parallel(&self, depth: u64, tt_size_mb: usize) -> u64

Parallel perft with transposition table for deep searches.

Uses rayon to parallelize at the top level and a lock-free transposition table to cache and reuse results for positions that occur via transposition.

Arguments

• depth - The search depth
• tt_size_mb - Approximate size of transposition table in megabytes (0 to disable)

Example

use kish::Board;

let board = Board::new_default();
// Use 256MB transposition table
let nodes = board.perft_parallel(9, 256);
println!("Perft(9) = {}", nodes);

Trait Implementations

impl Clone for Board

fn clone(&self) -> Board

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Board

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

Formats the value using the given formatter.

impl Default for Board

fn default() -> Board

Returns the “default value” for a type.

impl Display for Board

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

Formats the value using the given formatter.

impl From<Board> for Game

fn from(board: Board) -> Self

Converts to this type from the input type.

impl Hash for Board

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Board

fn cmp(&self, other: &Board) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Board

fn eq(&self, other: &Board) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Board

fn partial_cmp(&self, other: &Board) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for Board

impl Eq for Board

impl StructuralPartialEq for Board