1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104

use bitboard::{BitBoard, EMPTY};
use color::Color;
use square::Square;
use file::File;
/// What castle rights does a particular player have?
#[derive(Copy, Clone, PartialEq, PartialOrd)]
#[allow(dead_code)]
pub enum CastleRights {
    NoRights,
    KingSide,
    QueenSide,
    Both,
}

/// How many different types of `CastleRights` are there?
#[allow(dead_code)]
pub const NUM_CASTLE_RIGHTS: usize = 4;

/// Enumerate all castle rights.
#[allow(dead_code)]
pub const ALL_CASTLE_RIGHTS: [CastleRights; NUM_CASTLE_RIGHTS] = [CastleRights::NoRights, CastleRights::KingSide, CastleRights::QueenSide, CastleRights::Both];

impl CastleRights {
    /// Can I castle kingside?
    #[allow(dead_code)]
    pub fn has_kingside(&self) -> bool {
        self.to_index() & 1 == 1
    }

    /// Can I castle queenside?
    #[allow(dead_code)]
    pub fn has_queenside(&self) -> bool {
        self.to_index() & 2 == 2
    }

    /// What squares need to be empty to castle kingside?
    #[allow(dead_code)]
    pub fn kingside_squares(&self, color: Color) -> BitBoard {
        BitBoard::set(color.to_my_backrank(), File::F) ^
        BitBoard::set(color.to_my_backrank(), File::G)
    }

    /// What squares need to be empty to castle queenside?
    #[allow(dead_code)]
    pub fn queenside_squares(&self, color: Color) -> BitBoard {
        BitBoard::set(color.to_my_backrank(), File::B) ^
        BitBoard::set(color.to_my_backrank(), File::C) ^
        BitBoard::set(color.to_my_backrank(), File::D)
    }

    /// Remove castle rights, and return a new `CastleRights`.
    #[allow(dead_code)]
    pub fn remove(&self, remove: CastleRights) -> CastleRights {
        CastleRights::from_index(self.to_index() & !remove.to_index())
    }

    /// Add some castle rights, and return a new `CastleRights`.
    #[allow(dead_code)]
    pub fn add(&self, add: CastleRights) -> CastleRights {
        CastleRights::from_index(self.to_index() | add.to_index())
    }

    /// Convert `CastleRights` to `usize` for table lookups
    #[allow(dead_code)]
    pub fn to_index(&self) -> usize {
        *self as usize
    }

    /// Convert `usize` to `CastleRights`.  Panic if invalid number.
    #[allow(dead_code)]
    pub fn from_index(i: usize) -> CastleRights {
        match i {
            0 => CastleRights::NoRights,
            1 => CastleRights::KingSide,
            2 => CastleRights::QueenSide,
            3 => CastleRights::Both,
            _ => unreachable!()
        }
    }

    /// Which rooks can we "guarantee" we haven't moved yet?
    #[allow(dead_code)]
    pub fn unmoved_rooks(&self, color: Color) -> BitBoard {
        match *self {
            CastleRights::NoRights => EMPTY,
            CastleRights::KingSide => BitBoard::set(color.to_my_backrank(), File::H),
            CastleRights::QueenSide => BitBoard::set(color.to_my_backrank(), File::A),
            CastleRights::Both => BitBoard::set(color.to_my_backrank(), File::A) ^
                                  BitBoard::set(color.to_my_backrank(), File::H)
        }
    }

    /// Given a square of a rook, which side is it on?
    /// Note: It is invalid to pass in a non-rook square.  The code may panic.
    #[allow(dead_code)]
    pub fn rook_square_to_castle_rights(square: Square) -> CastleRights {
        match square.get_file() {
            File::A => CastleRights::QueenSide,
            File::H => CastleRights::KingSide,
            _       => unreachable!()
        }
    }
}