Struct BitBoard 

pub struct BitBoard {
    pub lo: u128,
    pub hi: u128,
}

225비트를 u128 × 2로 표현 lo: 비트 0~127, hi: 비트 128~224

Fields

lo: u128

hi: u128

Implementations

impl BitBoard

pub const EMPTY: Self

pub fn get(&self, idx: usize) -> bool

pub fn set(&mut self, idx: usize)

pub fn clear(&mut self, idx: usize)

pub fn or(&self, other: &BitBoard) -> BitBoard

pub fn count_ones(&self) -> u32

pub fn iter_ones(&self) -> BitBoardIter

Iterate over the indices of set bits, lowest first. Enables feature extraction loops to skip empty cells entirely — critical when the board is sparse (early/midgame), since a stone-driven pass is ~6× cheaper than scanning all 225 cells.

Trait Implementations

impl Clone for BitBoard

fn clone(&self) -> BitBoard

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl PartialEq for BitBoard

fn eq(&self, other: &BitBoard) -> 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 Copy for BitBoard

impl Eq for BitBoard

impl StructuralPartialEq for BitBoard