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
|
#include "Piece.hpp"
namespace chessarbiter {
Piece::Piece(char c, const std::string &coord)
: piece(c), isBlack(!isupper(c)), coord(coord) {}
std::vector<std::string> Piece::GetMoves() {
std::vector<std::string> moves;
char f = coord[0]; // File
char r = coord[1]; // Rank
if (piece == 'p' || piece == 'P') {
char side = 1;
if (piece == 'p') {
side = -1;
}
// First two steps
if ((r == '2' && piece == 'P') || (r == '7' && piece == 'p')) {
moves.push_back(std::string() + f + (char)(r + 2 * side));
}
if ((piece == 'P' && r < '8') || (piece == 'p' && r > '1')) {
moves.push_back(std::string() + f + (char)(r + 1 * side));
}
ADD_MOVE(f - 1, r + 1 * side);
ADD_MOVE(f + 1, r + 1 * side);
} else if (piece == 'k' || piece == 'K') {
ADD_MOVE(f, r - 1);
ADD_MOVE(f, r + 1);
ADD_MOVE(f + 1, r);
ADD_MOVE(f - 1, r);
ADD_MOVE(f + 1, r + 1);
ADD_MOVE(f - 1, r - 1);
ADD_MOVE(f + 1, r - 1);
ADD_MOVE(f - 1, r + 1);
} else if (piece == 'n' || piece == 'N') {
ADD_MOVE(f + 1, r + 2);
ADD_MOVE(f - 1, r + 2);
ADD_MOVE(f + 1, r - 2);
ADD_MOVE(f - 1, r - 2);
ADD_MOVE(f + 2, r + 1);
ADD_MOVE(f - 2, r + 1);
ADD_MOVE(f + 2, r - 1);
ADD_MOVE(f - 2, r - 1);
} else {
if (piece == 'b' || piece == 'B' || piece == 'Q' || piece == 'q') {
char rtmp = r;
char ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp++;
rtmp++;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp--;
rtmp--;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp--;
rtmp++;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp++;
rtmp--;
ADD_MOVE(ftmp, rtmp);
}
}
if (piece == 'r' || piece == 'R' || piece == 'Q' || piece == 'q') {
char rtmp = r;
char ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
rtmp++;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
rtmp--;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp++;
ADD_MOVE(ftmp, rtmp);
}
rtmp = r;
ftmp = f;
while (IS_FR_VALID(ftmp, rtmp)) {
ftmp--;
ADD_MOVE(ftmp, rtmp);
}
}
}
return (moves);
}
} // namespace chessarbiter
|
