blob: b711058e52c0ae39e4a372c41a1fb6482e92d9d9 (
plain)
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
|
#include "Board.hpp"
namespace chessarbiter {
bool Board::IsEmpty(const std::string &coord) {
for (Piece &p : pieces) {
if (p.coord == coord) {
return (false);
}
}
return (true);
}
bool Board::AddPiece(char p, const std::string &coord) {
if (IsEmpty(coord)) {
Piece piece(p, coord);
pieces.push_back(piece);
return (true);
}
return (false);
}
bool Board::RemovePiece(const std::string &coord) {
for (char i = 0; i < (char)pieces.size(); i++) {
if (pieces[i].coord == coord) {
pieces.erase(pieces.begin() + i);
return (true);
}
}
return false;
}
Piece Board::GetPieceAt(const std::string &coord) {
for (Piece &p : pieces) {
if (p.coord == coord)
return p;
}
throw NoPieceFound();
}
std::vector<Piece> Board::GetPlayerPieces(bool isBlack) {
std::vector<Piece> pp;
for (Piece &p : pieces) {
if (p.isBlack == isBlack) {
pp.push_back(p);
}
}
return (pp);
}
short Board::CountPiece(char c) {
char count = 0;
for (Piece &p : pieces) {
if (p.piece == c) {
count++;
}
}
return (count);
}
void Board::Clear() { pieces.clear(); }
std::string Board::GetKingLocation(bool isBlack) {
for (Piece &p : pieces) {
if (p.isBlack == isBlack) {
if (p.piece == 'k' || p.piece == 'K') {
return (p.coord);
}
}
}
throw NoPieceFound();
}
void Board::Move(const std::string &move) {
std::string src = move.substr(0, 2);
std::string dst = move.substr(2, 2);
RemovePiece(dst); // Remove piece on dst if exists
for (Piece &p : pieces) {
if (p.coord == src) {
p.coord = dst;
break;
}
}
}
bool Board::IsPieceMoveUnique(char piece, const std::string &move_dst) {
bool isBlack = std::islower(piece);
unsigned char count = 0;
for (std::string &move : ListPossibleMoves(isBlack)) {
std::string src = move.substr(0, 2);
std::string dst = move.substr(2, 2);
Piece p = GetPieceAt(src); // Never fails since it is legal
if (p.piece == piece && move_dst == dst) {
count++;
}
}
return (count <= 1);
}
std::string Board::Serialize() {
std::string s;
for (short i = 0; i < 8; i++) {
for (short j = 0; j < 8; j++) {
try {
Piece p = GetPieceAt((char)('a' + j) + std::string() + (char)('8' - i));
s += p.piece;
} catch (...) {
s += " ";
}
}
}
return (s);
}
bool Board::IsMovePossible(const std::string &move) {
std::string src = move.substr(0, 2);
std::string dst = move.substr(2, 2);
if (src == dst) {
return (false);
}
Piece srcp = GetPieceAt(src);
// Check move is possible
std::vector<std::string> srcm = srcp.GetMoves();
if (find(srcm.begin(), srcm.end(), dst) == srcm.end()) {
return (false);
}
// Check colors on dst square
// Seems that checking that is empty
// instead of catching NoPieceFound exception is
// more performant
if (!IsEmpty(dst)) {
Piece dstp = GetPieceAt(dst);
if (srcp.isBlack == dstp.isBlack)
return (false);
}
// Check if no piece in between
if (src[0] == dst[0] || src[1] == dst[1]) { // Rook like moves
if (src[0] == dst[0]) { // Vertical
char side = 1;
if (src[1] > dst[1]) {
side = -1;
}
char r = src[1] + 1 * side;
while (r != dst[1]) {
if (!IsEmpty(src[0] + std::string() + r)) {
return (false);
}
r += 1 * side;
}
} else { // Horizontal
char side = 1;
if (src[0] > dst[0]) {
side = -1;
}
char f = src[0] + 1 * side;
while (f != dst[0]) {
if (!IsEmpty(f + std::string() + src[1])) {
return (false);
}
f += 1 * side;
}
}
} else if ((src[0] - dst[0] == src[1] - dst[1]) ||
(dst[0] - src[0] == src[1] - dst[1])) { // Bishop like moves
// That code if for diagonal 1 (bottom left to up right)
// Using the d2 variable allow to reuse the same code for the 2 diagonals
char d2 = 1; // d2 stand for diagonal 2 (bottom right to up left)
if ((dst[0] - src[0] == src[1] - dst[1])) { // If move is for diagonal 2
d2 = -1;
}
// Move direction check
char side = 1;
if (src[0] > dst[0]) {
side = -1;
}
// Setup variables
char f = src[0] + 1 * side;
char r = src[1] + d2 * side;
// Perform empty square checks
while (f != dst[0] && r != dst[1]) {
if (!IsEmpty(f + std::string() + r)) {
return (false);
}
f += 1 * side;
r += d2 * side;
}
}
return (true);
}
std::vector<std::string> Board::ListPossibleMoves(bool isBlack) {
std::vector<std::string> moves;
for (Piece &p : pieces) {
if (p.isBlack == isBlack) {
for (std::string &m : p.GetMoves()) {
if (IsMovePossible(p.coord + m)) {
moves.push_back(p.coord + m);
}
}
}
}
return (moves);
}
} // namespace chessarbiter
|
