Enum myopic_board::Piece [−][src]
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
Implementations
impl Piece
[src]
impl Piece
[src]pub fn all() -> impl Iterator<Item = Piece>
[src]
pub fn all() -> impl Iterator<Item = Piece>
[src]Create an iterator traversing over all pieces in order.
pub fn whites() -> impl Iterator<Item = Piece>
[src]
pub fn whites() -> impl Iterator<Item = Piece>
[src]Create an iterator traversing over all white pieces in order.
pub fn blacks() -> impl Iterator<Item = Piece>
[src]
pub fn blacks() -> impl Iterator<Item = Piece>
[src]Create an iterator traversing over all black pieces in order.
pub fn of(side: Side) -> impl Iterator<Item = Piece>
[src]
pub fn of(side: Side) -> impl Iterator<Item = Piece>
[src]Returns a slice containing all pieces belonging to the given side.
pub fn control(
self,
loc: Square,
whites: BitBoard,
blacks: BitBoard
) -> BitBoard
[src]
pub fn control(
self,
loc: Square,
whites: BitBoard,
blacks: BitBoard
) -> BitBoard
[src]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
[src]
pub fn empty_control(self, loc: Square) -> BitBoard
[src]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
[src]
pub fn moves(self, loc: Square, whites: BitBoard, blacks: BitBoard) -> BitBoard
[src]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 Ord for Piece
[src]
impl Ord for Piece
[src]impl PartialOrd<Piece> for Piece
[src]
impl PartialOrd<Piece> for Piece
[src]pub fn partial_cmp(&self, other: &Piece) -> Option<Ordering>
[src]
pub fn partial_cmp(&self, other: &Piece) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl Reflectable for Piece
[src]
impl Reflectable for Piece
[src]We reflect a piece to it’s correspondent on the opposite side.
impl Copy for Piece
[src]
impl EnumSetType for Piece
[src]
impl Eq for Piece
[src]
Auto Trait Implementations
impl RefUnwindSafe for Piece
impl Send for Piece
impl Sync for Piece
impl Unpin for Piece
impl UnwindSafe for Piece
Blanket Implementations
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut Tⓘ
[src]
pub fn borrow_mut(&mut self) -> &mut Tⓘ
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more