/
MoveIntegration.h
263 lines (245 loc) · 9.73 KB
/
MoveIntegration.h
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
#ifndef LIBCHESS_MOVEINTEGRATION_H
#define LIBCHESS_MOVEINTEGRATION_H
namespace libchess {
inline Move::Type Position::move_type_of(Move move) const {
Move::Type move_type = move.type();
if (move_type != Move::Type::NONE) {
return move_type;
} else {
Square to_square = move.to_square();
Square from_square = move.from_square();
auto moving_pt = piece_type_on(from_square);
auto captured_pt = piece_type_on(to_square);
auto promotion_pt = move.promotion_piece_type();
if (promotion_pt) {
return captured_pt ? Move::Type::CAPTURE_PROMOTION : Move::Type::PROMOTION;
} else if (captured_pt) {
return Move::Type::CAPTURE;
} else if (moving_pt == constants::PAWN) {
int sq_diff = std::abs(to_square - from_square);
if (sq_diff == 16) {
return Move::Type::DOUBLE_PUSH;
} else if (sq_diff == 9 || sq_diff == 7) {
return Move::Type::ENPASSANT;
} else {
return Move::Type::NORMAL;
}
} else if (moving_pt == constants::KING && std::abs(to_square - from_square) == 2) {
return Move::Type::CASTLING;
} else {
return Move::Type::NORMAL;
}
}
}
inline bool Position::is_capture_move(Move move) const {
Move::Type move_type = move.type();
switch (move_type) {
case Move::Type::CAPTURE:
case Move::Type::CAPTURE_PROMOTION:
case Move::Type::ENPASSANT:
return true;
default:
return false;
}
}
inline bool Position::is_promotion_move(Move move) const {
Move::Type move_type = move.type();
switch (move_type) {
case Move::Type::PROMOTION:
case Move::Type::CAPTURE_PROMOTION:
return true;
default:
return false;
}
}
inline void Position::unmake_move() {
auto move = state().previous_move_;
if (side_to_move() == constants::WHITE) {
--fullmoves_;
}
Move::Type move_type = state().move_type_;
auto captured_pt = state().captured_pt_;
--ply_;
history_.pop_back();
reverse_side_to_move();
if (!move) {
return;
}
Color stm = side_to_move();
Square from_square = move->from_square();
Square to_square = move->to_square();
auto moving_pt = piece_type_on(to_square);
switch (move_type) {
case Move::Type::NORMAL:
move_piece(to_square, from_square, *moving_pt, stm);
break;
case Move::Type::CAPTURE:
move_piece(to_square, from_square, *moving_pt, stm);
put_piece(to_square, *captured_pt, !stm);
break;
case Move::Type::DOUBLE_PUSH:
move_piece(to_square, from_square, constants::PAWN, stm);
break;
case Move::Type::ENPASSANT:
put_piece(stm == constants::WHITE ? Square{to_square - 8} : Square(to_square + 8),
constants::PAWN,
!stm);
move_piece(to_square, from_square, constants::PAWN, stm);
break;
case Move::Type::CASTLING:
move_piece(to_square, from_square, constants::KING, stm);
switch (to_square) {
case constants::C1:
move_piece(constants::D1, constants::A1, constants::ROOK, stm);
break;
case constants::G1:
move_piece(constants::F1, constants::H1, constants::ROOK, stm);
break;
case constants::C8:
move_piece(constants::D8, constants::A8, constants::ROOK, stm);
break;
case constants::G8:
move_piece(constants::F8, constants::H8, constants::ROOK, stm);
break;
default:
break;
}
break;
case Move::Type::PROMOTION:
remove_piece(to_square, *move->promotion_piece_type(), stm);
put_piece(from_square, constants::PAWN, stm);
break;
case Move::Type::CAPTURE_PROMOTION:
remove_piece(to_square, *move->promotion_piece_type(), stm);
put_piece(from_square, constants::PAWN, stm);
put_piece(to_square, *captured_pt, !stm);
break;
case Move::Type::NONE:
break;
}
}
inline void Position::make_move(Move move) {
Color stm = side_to_move();
if (stm == constants::BLACK) {
++fullmoves_;
}
++ply_;
history_.push_back(State{});
State& prev_state = state_mut_ref(ply_ - 1);
State& next_state = state_mut_ref();
next_state.halfmoves_ = prev_state.halfmoves_ + 1;
next_state.previous_move_ = move;
next_state.enpassant_square_ = {};
Square from_square = move.from_square();
Square to_square = move.to_square();
next_state.castling_rights_ = CastlingRights{prev_state.castling_rights_.value() &
castling_spoilers[from_square.value()] &
castling_spoilers[to_square.value()]};
auto moving_pt = piece_type_on(from_square);
auto captured_pt = piece_type_on(to_square);
auto promotion_pt = move.promotion_piece_type();
Move::Type move_type = move_type_of(move);
if (moving_pt == constants::PAWN || captured_pt) {
next_state.halfmoves_ = 0;
}
bool calc_hash = true;
switch (move_type) {
case Move::Type::NORMAL:
move_piece(from_square, to_square, *moving_pt, stm);
calc_hash = false;
next_state.hash_ = prev_state.hash_;
next_state.hash_ ^= zobrist::piece_square_key(from_square, *moving_pt, stm);
next_state.hash_ ^= zobrist::piece_square_key(to_square, *moving_pt, stm);
break;
case Move::Type::CAPTURE:
remove_piece(to_square, *captured_pt, !stm);
move_piece(from_square, to_square, *moving_pt, stm);
calc_hash = false;
next_state.hash_ = prev_state.hash_;
next_state.hash_ ^= zobrist::piece_square_key(to_square, *captured_pt, !stm);
next_state.hash_ ^= zobrist::piece_square_key(from_square, *moving_pt, stm);
next_state.hash_ ^= zobrist::piece_square_key(to_square, *moving_pt, stm);
break;
case Move::Type::DOUBLE_PUSH:
move_piece(from_square, to_square, constants::PAWN, stm);
calc_hash = false;
next_state.hash_ = prev_state.hash_;
next_state.enpassant_square_ =
stm == constants::WHITE ? Square(from_square + 8) : Square(from_square - 8);
next_state.hash_ ^= zobrist::enpassant_key(next_state.enpassant_square_.value());
next_state.hash_ ^= zobrist::piece_square_key(from_square, constants::PAWN, stm);
next_state.hash_ ^= zobrist::piece_square_key(to_square, constants::PAWN, stm);
break;
case Move::Type::ENPASSANT:
move_piece(from_square, to_square, constants::PAWN, stm);
remove_piece(stm == constants::WHITE ? Square(to_square - 8) : Square(to_square + 8),
constants::PAWN,
!stm);
break;
case Move::Type::CASTLING:
move_piece(from_square, to_square, constants::KING, stm);
switch (to_square) {
case constants::C1:
move_piece(constants::A1, constants::D1, constants::ROOK, stm);
break;
case constants::G1:
move_piece(constants::H1, constants::F1, constants::ROOK, stm);
break;
case constants::C8:
move_piece(constants::A8, constants::D8, constants::ROOK, stm);
break;
case constants::G8:
move_piece(constants::H8, constants::F8, constants::ROOK, stm);
break;
default:
break;
}
break;
case Move::Type::PROMOTION:
remove_piece(from_square, constants::PAWN, stm);
put_piece(to_square, *promotion_pt, stm);
break;
case Move::Type::CAPTURE_PROMOTION:
remove_piece(to_square, *captured_pt, !stm);
remove_piece(from_square, constants::PAWN, stm);
put_piece(to_square, *promotion_pt, stm);
break;
case Move::Type::NONE:
break;
}
next_state.captured_pt_ = captured_pt;
next_state.move_type_ = move_type;
reverse_side_to_move();
if (calc_hash)
next_state.hash_ = calculate_hash();
else {
if (prev_state.enpassant_square_.has_value())
next_state.hash_ ^= zobrist::enpassant_key(prev_state.enpassant_square_.value());
next_state.hash_ ^= zobrist::side_to_move_key(!stm);
next_state.hash_ ^= zobrist::side_to_move_key(stm);
}
next_state.pawn_hash_ = calculate_pawn_hash();
}
inline void Position::make_null_move() {
Color stm = side_to_move();
if (stm == constants::BLACK) {
++fullmoves_;
}
++ply_;
history_.push_back(State{});
State& prev = state_mut_ref(ply_ - 1);
State& next = state_mut_ref();
reverse_side_to_move();
next.previous_move_ = {};
next.halfmoves_ = prev.halfmoves_ + 1;
next.castling_rights_ = prev.castling_rights_;
next.hash_ = prev.hash_;
if (prev.enpassant_square_.has_value())
next.hash_ ^= zobrist::enpassant_key(prev.enpassant_square_.value());
next.hash_ ^= zobrist::side_to_move_key(!stm);
next.hash_ ^= zobrist::side_to_move_key(stm);
next.enpassant_square_ = {};
next.pawn_hash_ = calculate_pawn_hash();
}
} // namespace libchess
#endif // LIBCHESS_MOVEINTEGRATION_H