-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMove.cpp
More file actions
333 lines (320 loc) · 6.37 KB
/
Move.cpp
File metadata and controls
333 lines (320 loc) · 6.37 KB
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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
#include "Move.h"
Move::Move()
{
piece = nullptr;
captured = nullptr;
isPromoting = false;
isCapture = false;
isEP = false;
oldPassantSquare = -1;
oldPassantPieceSquare = -1;
isCastle = false;
oldCastlingRights = 0;
//lossOfEP = false;
//lostEP = nullptr;
promoPiece = 0;
oldHalfmoves = -1;
oldX = -1;
oldY = -1;
newX = -1;
newY = -1;
//fen = "";
}
Move::Move(Piece* p, Piece* cap, bool isPromo, bool isCap, bool ispassant, int oldPasSq, int oldPasP, bool isCas, uint8_t oldCas,
/*bool lossPass, Piece* lostPass,*/ uint8_t proPiece, int oldHalves, int oldx, int oldy, int newx, int newy/*, std::string FEN */) :
piece(p),
captured(cap),
isPromoting(isPromo),
isCapture(isCap),
isEP(ispassant),
oldPassantSquare(oldPasSq),
oldPassantPieceSquare(oldPasP),
isCastle(isCas),
oldCastlingRights(oldCas),
//lossOfEP(lossPass),
//lostEP(lostPass),
promoPiece(proPiece),
oldHalfmoves(oldHalves),
oldX(oldx),
oldY(oldy),
newX(newx),
newY(newy)
{
/*
piece = p;
captured = cap;
isPromoting = isPromo;
isCapture = isCap;
isEP = ispassant;
oldPassantSquare = oldPasSq;
oldPassantPieceSquare = oldPasP;
isCastle = isCas;
oldCastlingRights = oldCas;
lossOfEP = lossPass;
lostEP = lostPass;
promoPiece = proPiece;
oldHalfmoves = oldHalves;
oldX = oldx;
oldY = oldy;
newX = newx;
newY = newy;
//fen = FEN;
*/
}
Move::~Move()
{
;
}
Move* Move::cloneMove()
{
Move* newMove = new Move(piece, captured, isPromoting, isCapture, isEP,
oldPassantSquare, oldPassantPieceSquare, isCastle, oldCastlingRights, /*lossOfEP, lostEP,*/ promoPiece,
oldHalfmoves, oldX, oldY, newX, newY);
return newMove;
}
void Move::printMove()
{
std::cout << "Piece: ";
if (!piece) std::cout << "Not defined\n";
else
{
switch (piece->info)
{
case WHITE_PAWN:
std::cout << "White pawn\n";
break;
case WHITE_KNIGHT:
std::cout << "White knight\n";
break;
case WHITE_BISHOP:
std::cout << "White bishop\n";
break;
case WHITE_ROOK:
std::cout << "White rook\n";
break;
case WHITE_QUEEN:
std::cout << "White queen\n";
break;
case WHITE_KING:
std::cout << "White king\n";
break;
case BLACK_PAWN:
std::cout << "Black pawn\n";
break;
case BLACK_KNIGHT:
std::cout << "Black knight\n";
break;
case BLACK_BISHOP:
std::cout << "Black bishop\n";
break;
case BLACK_ROOK:
std::cout << "Black rook\n";
break;
case BLACK_QUEEN:
std::cout << "Black queen\n";
break;
case BLACK_KING:
std::cout << "Black king\n";
break;
}
}
int oldIndex = 8 * (7 - oldY) + oldX;
char oldFile = (oldIndex % 8) + 'a';
int oldRank = (oldIndex / 8) + 1;
int newIndex = 8 * (7 - newY) + newX;
char newFile = (newIndex % 8) + 'a';
int newRank = (newIndex / 8) + 1;
std::cout << "Moving from " << oldFile << oldRank << " to " << newFile << newRank << '\n';
std::cout << "Is capture: " << isCapture << '\n' << " Captured piece: ";
if (isCapture)
{
switch (captured->info)
{
case WHITE_PAWN:
std::cout << "White pawn\n";
break;
case WHITE_KNIGHT:
std::cout << "White knight\n";
break;
case WHITE_BISHOP:
std::cout << "White bishop\n";
break;
case WHITE_ROOK:
std::cout << "White rook\n";
break;
case WHITE_QUEEN:
std::cout << "White queen\n";
break;
case WHITE_KING:
std::cout << "White king\n";
break;
case BLACK_PAWN:
std::cout << "Black pawn\n";
break;
case BLACK_KNIGHT:
std::cout << "Black knight\n";
break;
case BLACK_BISHOP:
std::cout << "Black bishop\n";
break;
case BLACK_ROOK:
std::cout << "Black rook\n";
break;
case BLACK_QUEEN:
std::cout << "Black queen\n";
break;
case BLACK_KING:
std::cout << "Black king\n";
break;
}
}
else std::cout << "N/A\n";
std::cout << "Is promoting: " << isPromoting << '\n' << " Promoting to: ";
if (isPromoting)
{
switch (promoPiece)
{
case WHITE_PAWN:
std::cout << "White pawn\n";
break;
case WHITE_KNIGHT:
std::cout << "White knight\n";
break;
case WHITE_BISHOP:
std::cout << "White bishop\n";
break;
case WHITE_ROOK:
std::cout << "White rook\n";
break;
case WHITE_QUEEN:
std::cout << "White queen\n";
break;
case WHITE_KING:
std::cout << "White king\n";
break;
case BLACK_PAWN:
std::cout << "Black pawn\n";
break;
case BLACK_KNIGHT:
std::cout << "Black knight\n";
break;
case BLACK_BISHOP:
std::cout << "Black bishop\n";
break;
case BLACK_ROOK:
std::cout << "Black rook\n";
break;
case BLACK_QUEEN:
std::cout << "Black queen\n";
break;
case BLACK_KING:
std::cout << "Black king\n";
break;
}
}
else std::cout << "N/A\n";
std::cout << "Is castle: " << isCastle << '\n';
std::cout << "Is en passant: " << isEP << "\n\n\n";
}
// on the basis of MVV LVA for move ordering.
bool Move::operator< (const Move* m)
{
int value1, value2, attack1, attack2, vic1, vic2;
// get first move's attacker index
if (piece->info & PAWN)
{
attack1 = 5;
}
else if (piece->info & KNIGHT)
{
attack1 = 4;
}
else if (piece->info & BISHOP)
{
attack1 = 3;
}
else if (piece->info & ROOK)
{
attack1 = 2;
}
else if (piece->info & QUEEN)
{
attack1 = 1;
}
else attack1 = 0; // king
// get second move's attacker index
if (piece->info & PAWN)
{
attack2 = 5;
}
else if (piece->info & KNIGHT)
{
attack2 = 4;
}
else if (piece->info & BISHOP)
{
attack2 = 3;
}
else if (piece->info & ROOK)
{
attack2 = 2;
}
else if (piece->info & QUEEN)
{
attack2 = 1;
}
else attack2 = 0; // king
// get first move's victim index
if (captured)
{
if (captured->info & PAWN)
{
vic1 = 4;
}
else if (captured->info & KNIGHT)
{
vic1 = 3;
}
else if (captured->info & BISHOP)
{
vic1 = 2;
}
else if (captured->info & ROOK)
{
vic1 = 1;
}
else if (captured->info & QUEEN)
{
vic1 = 0;
}
}
else vic1 = 5;
// get second move's victim index
if (m->captured)
{
if (m->captured->info & PAWN)
{
vic2 = 4;
}
else if (m->captured->info & KNIGHT)
{
vic2 = 3;
}
else if (m->captured->info & BISHOP)
{
vic2 = 2;
}
else if (m->captured->info & ROOK)
{
vic2 = 1;
}
else if (m->captured->info & QUEEN)
{
vic2 = 0;
}
}
else vic2 = 5;
// now, get capture values from table
value1 = MVVLVA_TABLE[vic1][attack1], value2 = MVVLVA_TABLE[vic2][attack2];
return (value1 > value2); // if the first value is greater, the first move should come before the other
}