rust_fish_chess_engine 0.1.4

A chess engine and functionality built in Rust. Built for the intention of incorporating it into my Svelte chess project through WASM.
Documentation 
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181


#[cfg(test)]
mod tests {
    use rust_fish_chess_engine::{chess_functionality::moves::{calculate_possible_moves, king::CastleState}, Piece, PieceType};

    #[test]
    fn rook_valid_moves_middle_board() {
        let mut board = vec![vec![None; 8]; 8];
        board[4][4] = Some(Piece::White(PieceType::Rook)); // Rook in the middle

        let possible_moves = calculate_possible_moves(4, 4, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();

        let mut expected_moves = vec![];
        for i in 0..8 {
            if i != 4 {
                expected_moves.push((4, i)); // Horizontal moves
                expected_moves.push((i, 4)); // Vertical moves
            }
        }

        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_valid_moves_edge_board() {
        let mut board = vec![vec![None; 8]; 8];
        board[0][4] = Some(Piece::White(PieceType::Rook)); // Rook on top edge

        let mut expected_moves = vec![];
        for i in 1..8 {
            expected_moves.push((i, 4)); // Downward vertical moves
        }
        for i in 0..8 {
            if i != 4 {
                expected_moves.push((0, i)); // Horizontal moves
            }
        }

        let possible_moves = calculate_possible_moves(0, 4, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_valid_moves_corner_board() {
        let mut board = vec![vec![None; 8]; 8];
        board[0][0] = Some(Piece::White(PieceType::Rook)); // Rook in top-left corner

        let mut expected_moves = vec![];
        for i in 1..8 {
            expected_moves.push((i, 0)); // Vertical moves
            expected_moves.push((0, i)); // Horizontal moves
        }

        let possible_moves = calculate_possible_moves(0, 0, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_moves_blocked_by_same_color() {
        let mut board = vec![vec![None; 8]; 8];
        board[4][4] = Some(Piece::White(PieceType::Rook));
        board[4][6] = Some(Piece::White(PieceType::Pawn)); // Blocked horizontally
        board[6][4] = Some(Piece::White(PieceType::Pawn)); // Blocked vertically

        let expected_moves = vec![
            (4, 5), (4, 3), (4, 2), (4, 1), (4, 0),
            (5, 4), (3, 4), (2, 4), (1, 4), (0, 4)
        ];

        let possible_moves = calculate_possible_moves(4, 4, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_moves_blocked_by_same_color_alt_color() {
        let mut board = vec![vec![None; 8]; 8];
        board[4][4] = Some(Piece::Black(PieceType::Rook));
        board[4][6] = Some(Piece::Black(PieceType::Pawn)); // Blocked horizontally
        board[6][4] = Some(Piece::Black(PieceType::Pawn)); // Blocked vertically

        let expected_moves = vec![
            (4, 5), (4, 3), (4, 2), (4, 1), (4, 0),
            (5, 4), (3, 4), (2, 4), (1, 4), (0, 4)
        ];

        let possible_moves = calculate_possible_moves(4, 4, &mut board, false, false, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_can_capture_opponent_piece() {
        let mut board = vec![vec![None; 8]; 8];
        board[4][4] = Some(Piece::White(PieceType::Rook));
        board[4][6] = Some(Piece::Black(PieceType::Pawn)); // Capturable piece
        board[6][4] = Some(Piece::Black(PieceType::Pawn)); // Capturable piece

        let expected_moves = vec![
            (4, 5), (4, 6), (4, 3), (4, 2), (4, 1), (4, 0),
            (5, 4), (6, 4), (3, 4), (2, 4), (1, 4), (0, 4)
        ];

        let possible_moves = calculate_possible_moves(4, 4, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_can_capture_opponent_piece_alt_color() {
        let mut board = vec![vec![None; 8]; 8];
        board[4][4] = Some(Piece::Black(PieceType::Rook));
        board[4][6] = Some(Piece::White(PieceType::Pawn)); // Capturable piece
        board[6][4] = Some(Piece::White(PieceType::Pawn)); // Capturable piece

        let expected_moves = vec![
            (4, 5), (4, 6), (4, 3), (4, 2), (4, 1), (4, 0),
            (5, 4), (6, 4), (3, 4), (2, 4), (1, 4), (0, 4)
        ];

        let possible_moves = calculate_possible_moves(4, 4, &mut board, false, false, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_cannot_move_outside_board() {
        let mut board = vec![vec![None; 8]; 8];
        board[0][0] = Some(Piece::White(PieceType::Rook)); // Rook in top-left corner

        let mut expected_moves = vec![];
        for i in 1..8 {
            expected_moves.push((i, 0)); // Vertical moves
            expected_moves.push((0, i)); // Horizontal moves
        }

        let possible_moves = calculate_possible_moves(0, 0, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

    #[test]
    fn rook_all_valid_moves_covered() {
        let mut board = vec![vec![None; 8]; 8];
        board[3][3] = Some(Piece::White(PieceType::Rook)); // Rook in the middle

        let mut expected_moves = vec![];
        for i in 0..8 {
            if i != 3 {
                expected_moves.push((3, i)); // Horizontal moves
                expected_moves.push((i, 3)); // Vertical moves
            }
        }

        let possible_moves = calculate_possible_moves(3, 3, &mut board, false, true, &None, &mut CastleState::new(), false).unwrap();
        assert_eq!(possible_moves.len(), expected_moves.len(), "Expected and actual moves differ in count");
        for m in possible_moves {
            assert!(expected_moves.contains(&m.new_pos), "Unexpected move: {:?}", m.new_pos);
        }
    }

}