Enum myopic_board::Piece

pub enum Piece {
    WP,
    WN,
    WB,
    WR,
    WQ,
    WK,
    BP,
    BN,
    BB,
    BR,
    BQ,
    BK,
}

Value type wrapping a single integer representing one of the 12 different pieces in a game of chess.

Variants

WP

WN

WB

WR

WQ

WK

BP

BN

BB

BR

BQ

BK

Implementations

impl Piece

pub fn all() -> impl Iterator<Item = Piece>

Create an iterator traversing over all pieces in order.

pub fn whites() -> impl Iterator<Item = Piece>

Create an iterator traversing over all white pieces in order.

pub fn blacks() -> impl Iterator<Item = Piece>

Create an iterator traversing over all black pieces in order.

pub fn king(side: Side) -> Piece

Returns the king which belongs to the given side.

pub fn queen(side: Side) -> Piece

Returns the queen which belongs to the given side.

pub fn rook(side: Side) -> Piece

Returns the rook belonging to the given side.

pub fn pawn(side: Side) -> Piece

Returns the pawn which belongs to the given side.

pub fn of(side: Side) -> impl Iterator<Item = Piece>

Returns a slice containing all pieces belonging to the given side.

pub fn side(self) -> Side

Returns the side that this piece belongs to.

pub fn is_pawn(self) -> bool

Checks whether this piece is either a white or black pawn.

pub fn is_knight(self) -> bool

Checks whether this piece is either a white or black knight.

pub fn control(
    self,
    loc: Square,
    whites: BitBoard,
    blacks: BitBoard
) -> BitBoard

Computes the control set for this piece given it’s location and the locations of all the white and black pieces on the board.

pub fn empty_control(self, loc: Square) -> BitBoard

Computes the control set for this piece given it’s location on an empty board.

pub fn moves(self, loc: Square, whites: BitBoard, blacks: BitBoard) -> BitBoard

Computes the set of legal moves for this piece given it’s location and the locations of all the white and black pieces on the board. Note that this method does not take into account special restrictions for or due to the king, e.g. can’t move in such a way to put the king into check.

Trait Implementations

impl<O> BitAnd<O> for Piece where
    O: Into<EnumSet<Piece>>, 

type Output = EnumSet<Piece>

The resulting type after applying the & operator.

pub fn bitand(self, other: O) -> <Piece as BitAnd<O>>::Output

Performs the & operation.

impl<O> BitOr<O> for Piece where
    O: Into<EnumSet<Piece>>, 

type Output = EnumSet<Piece>

The resulting type after applying the | operator.

pub fn bitor(self, other: O) -> <Piece as BitOr<O>>::Output

Performs the | operation.

impl<O> BitXor<O> for Piece where
    O: Into<EnumSet<Piece>>, 

type Output = EnumSet<Piece>

The resulting type after applying the ^ operator.

pub fn bitxor(self, other: O) -> <Piece as BitXor<O>>::Output

Performs the ^ operation.

impl Clone for Piece

pub fn clone(&self) -> Piece

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Piece

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

Formats the value using the given formatter.

impl Display for Piece

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

Formats the value using the given formatter.

impl FromStr for Piece

type Err = Error

The associated error which can be returned from parsing.

pub fn from_str(s: &str) -> Result<Piece, <Piece as FromStr>::Err>

Parses a string s to return a value of this type.

impl Hash for Piece

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl Not for Piece

type Output = EnumSet<Piece>

The resulting type after applying the ! operator.

pub fn not(self) -> <Piece as Not>::Output

Performs the unary ! operation.

impl Ord for Piece

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

This method returns an Ordering between self and other.

#[must_use]

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

Compares and returns the maximum of two values.

#[must_use]

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

Compares and returns the minimum of two values.

#[must_use]

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

Restrict a value to a certain interval.

impl PartialEq<EnumSet<Piece>> for Piece

pub fn eq(&self, other: &EnumSet<Piece>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]

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

This method tests for !=.

impl PartialEq<Piece> for Piece

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]

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

This method tests for !=.

impl PartialOrd<Piece> for Piece

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

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

#[must_use]

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

This method tests less than (for self and other) and is used by the < operator.

#[must_use]

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

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

#[must_use]

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

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]

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

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

impl Reflectable for Piece

We reflect a piece to it’s correspondent on the opposite side.

pub fn reflect(&self) -> Piece

impl<O> Sub<O> for Piece where
    O: Into<EnumSet<Piece>>, 

type Output = EnumSet<Piece>

The resulting type after applying the - operator.

pub fn sub(self, other: O) -> <Piece as Sub<O>>::Output

Performs the - operation.

impl Copy for Piece

impl EnumSetType for Piece

impl Eq for Piece