-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMoveFinder.cpp
More file actions
283 lines (233 loc) · 6.99 KB
/
MoveFinder.cpp
File metadata and controls
283 lines (233 loc) · 6.99 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
/*
* MoveFinder.cpp
*
* Created on: Jun 20, 2014
* Author: shaun
*/
#include "MoveFinder.h"
namespace NN
{
MoveFinder::MoveFinder()
{}
MoveFinder::~MoveFinder()
{}
CheckersMoveFinder::CheckersMoveFinder()
: m_side(0)
{}
float&
CheckersMoveFinder::pieceAt(size_t row, size_t col)
{
return m_state[row*4 + col];
}
bool
CheckersMoveFinder::frontRightJump(size_t row, size_t col)
{
auto& neighbor_square = pieceAt(row + 1, col + 1 - row % 2);
auto& target_square = pieceAt(row + 2, col + 1);
auto& our_square = pieceAt(row, col);
return jump(row + 2, col + 1, neighbor_square, target_square, our_square);
}
bool
CheckersMoveFinder::frontLeftJump(size_t row, size_t col)
{
auto& neighbor_square = pieceAt(row + 1, col - row % 2);
auto& target_square = pieceAt(row + 2, col - 1);
auto& our_square = pieceAt(row, col);
return jump(row + 2, col - 1, neighbor_square, target_square, our_square);
}
bool
CheckersMoveFinder::backRightJump(size_t row, size_t col)
{
auto& neighbor_square = pieceAt(row - 1, col + 1 - row % 2);
auto& target_square = pieceAt(row - 2, col + 1);
auto& our_square = pieceAt(row, col);
return jump(row - 2, col + 1, neighbor_square, target_square, our_square);
}
bool
CheckersMoveFinder::backLeftJump(size_t row, size_t col)
{
auto& neighbor_square = pieceAt(row - 1, col - row % 2);
auto& target_square = pieceAt(row - 2, col - 1);
auto& our_square = pieceAt(row, col);
return jump(row - 2, col - 1, neighbor_square, target_square, our_square);
}
bool
CheckersMoveFinder::jump(size_t row, size_t col, float& neighbor_square,
float& target_square, float& our_square)
{
if( (neighbor_square * m_side < 0.0) && (target_square == 0.0) )
{
float captured_piece = neighbor_square;
neighbor_square = 0.0;
target_square = our_square;
our_square = 0.0;
if( ((row == 7) || (row == 0)) &&
(target_square * m_side <= PAWN + .1) )
{ // turn it into a king
target_square = m_side * KING;
m_moves.push_back(m_state);
target_square = m_side * PAWN;
}
else
{ // try to keep jumping
findJump(row, col);
}
neighbor_square = captured_piece;
our_square = target_square;
target_square = 0.0;
return true;
}
return false;
}
bool
CheckersMoveFinder::tryToJump(float piece, size_t row, size_t col)
{
bool can_jump = false;
if( (piece < -PAWN - .1 || piece > -PAWN + .1) && row < 6) // anything but a red pawn
{
if( col > 0 )
{
can_jump = frontLeftJump(row, col) || can_jump;
}
if( col < 3 )
{
can_jump = frontRightJump(row, col) || can_jump;
}
}
if( (piece < PAWN - .1 || piece > PAWN + .1) && row > 1 ) // anything but a black pawn
{
if( col > 0 )
{
can_jump = backLeftJump(row, col) || can_jump;
}
if( col < 3 )
{
can_jump = backRightJump(row, col) || can_jump;
}
}
return can_jump;
}
void
CheckersMoveFinder::findJump(size_t row, size_t col)
{
bool can_jump = tryToJump(pieceAt(row, col), row, col);
if( !can_jump )
{
m_moves.push_back(m_state);
}
}
void
CheckersMoveFinder::move(size_t row1, size_t col1, size_t row2, size_t col2)
{
auto& to = pieceAt(row2, col2);
if( to < 0.1 && to > -0.1 )
{
auto& from = pieceAt(row1, col1);
if( (row2 == 7 || row2 == 0) && (from * m_side <= PAWN + .1) )
{
to = m_side *KING;
from = 0.0;
m_moves.push_back(m_state);
from = m_side * PAWN;
to = 0.0;
}
else
{
to = from;
from = 0.0;
m_moves.push_back(m_state);
from = to;
to = 0.0;
}
}
}
const vector<vector<float>>&
CheckersMoveFinder::possibleMoves(const vector<float>& current_state, bool black_player)
{
if(black_player)
m_side = 1;
else
m_side = -1;
m_state = current_state;
m_moves.clear();
bool can_jump = false;
// Check for possible jumps first, since they must be taken
for(auto row = 0u; row < 8u; ++row)
{
for(auto col = 0u; col < 4u; ++col)
{
auto piece = pieceAt(row, col);
if(piece * m_side > 0.1) // our piece
{
can_jump = tryToJump(piece, row, col) || can_jump;
}
}
}
// If no jumps are possible, check for other possible moves
if( !can_jump )
{
for(auto row = 0u; row < 8u; ++row)
{
for(auto col = 0u; col < 4u; ++col)
{
auto& piece = pieceAt(row, col);
if( piece * m_side > 0.1 ) // our piece
{
if( !odd(row) )
{
if( piece < -PAWN - .1 || piece > -PAWN + .1) // anything but red pawn
{
// front left
move(row, col, row+1, col);
if(col < 3)
{
// front right
move(row, col, row+1, col+1);
}
}
if( (piece < PAWN -.1 || piece > PAWN + .1) && (row > 0) ) // anything but black pawn
{
// back left
move(row, col, row-1, col);
if(col < 3)
{
// back right
move(row, col, row-1, col+1);
}
}
}
else
{
if( (piece < -PAWN -.1 || piece > -PAWN + .1) && row < 7) // anything but a red pawn
{
// front right
move(row, col, row+1, col);
if(col > 0)
{
// front left
move(row, col, row+1, col-1);
}
}
if( piece < PAWN - .1 || piece > PAWN + .1 ) // anything but a black pawn
{
// back right
move(row, col, row-1, col);
if(col > 0)
{
// back left
move(row, col, row-1, col-1);
}
}
}
}
}
}
}
return m_moves;
}
bool
CheckersMoveFinder::odd(unsigned integer) const
{
return integer % 2;
}
} /* namespace NN */