-
Notifications
You must be signed in to change notification settings - Fork 0
/
game.cpp
255 lines (224 loc) · 6.57 KB
/
game.cpp
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
#include <algorithm>
#include <iostream>
#include <string>
#include <cassert>
#include <chrono>
#include <random>
#include "chess_board.h"
#include "chess_piece.h"
#include "game.h"
chess_game::chess_game()
: m_board{},
m_whose_turn(piece_color::white)
{
}
bool chess_game::CanDoMove(const chess_move& move) const
{
//Regular move
const chess_piece piece = m_board.GetPiece(move.x1,move.y1);
//Is it of the right color?
if (piece.GetColor()!=m_whose_turn) return false;
//Is the captured piece of the other color?
//->checked by ChessBoard
//ChessBoard checks the rest
return m_board.CanDoMove(move);
}
void chess_game::DoMove(const chess_move& move)
{
assert(this->CanDoMove(move));
m_board.DoMove(move);
m_whose_turn = (m_whose_turn == piece_color::white ? piece_color::black : piece_color::white);
}
void chess_game::CoutGame() const
{
m_board.CoutSight(m_whose_turn);
std::cout
<< std::endl
<< (m_whose_turn == piece_color::white ? "White" : "Black")
<< " player's turn"
<< std::endl;
}
void chess_game::CoutBoard() const
{
m_board.CoutPieces(m_whose_turn);
std::cout
<< std::endl
<< (m_whose_turn == piece_color::white ? "White" : "Black")
<< " player's turn"
<< std::endl;
}
bool chess_game::IsGameOver() const
{
return m_board.IsGameOver();
}
piece_color chess_game::GetWinner() const
{
assert(this->IsGameOver());
return m_board.GetWinner();
}
const std::vector<std::vector<bool> > chess_game::GetInSight() const
{
return m_board.GetInSight(m_whose_turn);
}
chess_move chess_game::SuggestMove() const
{
//Get all possible moves
std::vector<chess_move> moves = m_board.GetAllPossibleMoves(m_whose_turn);
//std::random_shuffle(moves.begin(), moves.end() );
const unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
std::shuffle(moves.begin(), moves.end(), std::default_random_engine(seed));
const int nMoves = moves.size();
assert(nMoves>0);
const std::vector<double> moveValues = AttributeValues(moves);
const std::vector<double>::const_iterator pMove
= std::max_element( moveValues.begin(),moveValues.end() );
const int index = pMove - moveValues.begin();
assert(index >= 0);
assert(index < static_cast<int>(moves.size()));
return moves[ index ];
}
std::vector<double> chess_game::AttributeValues(
const std::vector<chess_move>& moves) const
{
const int nMoves = moves.size();
std::vector<double> v(nMoves,0.0);
for (int i=0; i!=nMoves; ++i)
{
v[i] = AttributeValue(moves[i]);
}
return v;
}
double chess_game::AttributeValue(
const chess_move& move) const
{
double value = 0.0;
const int y1 = move.y1;
const int x1 = move.x1;
const int y2 = move.y2;
const int x2 = move.x2;
const chess_piece piece = m_board.GetPiece(x1,y1);
assert(piece.IsNull()==false);
//const piece_color color = piece.GetColor();
if (m_board.GetPiece(x2,y2).IsNull()==false)
{
//An expensive piece should not take a cheaper piece
//The more expensive the piece to move,
// the less motivated it will be to take a piece
if (piece.GetType()==king ) { value-=100.0; }
if (piece.GetType()==queen ) { value-= 9.0; }
if (piece.GetType()==rook ) { value-= 4.0; }
if (piece.GetType()==bishop) { value-= 2.0; }
if (piece.GetType()==knight) { value-= 2.0; }
if (piece.GetType()==pawn ) { value-= 0.0; }
//The more expensive the piece to take,
// the more motivated it will be to take it
const chess_piece victim = m_board.GetPiece(x2,y2);
if (victim.GetType()==king ) { value+=100000.0; }
if (victim.GetType()==queen ) { value+=10.0; }
if (victim.GetType()==rook ) { value+= 5.0; }
if (victim.GetType()==bishop) { value+= 3.0; }
if (victim.GetType()==knight) { value+= 3.0; }
if (victim.GetType()==pawn ) { value+= 1.0; }
}
return value;
}
//Parse in the format:
//a2 a4
//a2xb3
//Na1 a8
//Pc1xd5
bool chess_game::ParseMove(
const std::string& s,
chess_move& move) const
{
if (s.empty()) return false;
//Obtain chesstypes from the only upper case character at the first index
//If there is no upper case, it is a pawn
if (s=="o-o" || s=="O-O" || s == "0-0")
{
const int y = (this->get_whose_turn() == piece_color::white ? 0 : 7);
move = chess_move(king,4,y,false,6,y);
return true;
}
if (s=="o-o-o" || s=="O-O-O" || s == "0-0-0")
{
const int y = (this->get_whose_turn() == piece_color::white ? 0 : 7);
move = chess_move(king,4,y,false,2,y);
return true;
}
switch(s[0])
{
case 'N': move.type = knight; break;
case 'B': move.type = bishop; break;
case 'R': move.type = rook ; break;
case 'Q': move.type = queen ; break;
case 'K': move.type = king ; break;
default: move.type = pawn;
}
const int minSize = (move.type == pawn ? 5 : 6);
if (static_cast<int>(s.size()) < minSize) return false;
if (move.type == pawn)
{
if (s[2]==' ') move.capture = false;
else if (s[2]=='x') move.capture = true;
else return false;
}
else
{
if (s[3]==' ') move.capture = false;
else if (s[3]=='x') move.capture = true;
else return false;
}
const std::string from = (move.type == pawn ? s.substr(0,2) : s.substr(1,2) );
const std::string to = (move.type == pawn ? s.substr(3,2) : s.substr(4,2) );
switch(from[0])
{
case 'a': move.x1 = 0; break;
case 'b': move.x1 = 1; break;
case 'c': move.x1 = 2; break;
case 'd': move.x1 = 3; break;
case 'e': move.x1 = 4; break;
case 'f': move.x1 = 5; break;
case 'g': move.x1 = 6; break;
case 'h': move.x1 = 7; break;
default: return false;
}
switch(from[1])
{
case '1': move.y1 = 0; break;
case '2': move.y1 = 1; break;
case '3': move.y1 = 2; break;
case '4': move.y1 = 3; break;
case '5': move.y1 = 4; break;
case '6': move.y1 = 5; break;
case '7': move.y1 = 6; break;
case '8': move.y1 = 7; break;
default: return false;
}
switch(to[0])
{
case 'a': move.x2 = 0; break;
case 'b': move.x2 = 1; break;
case 'c': move.x2 = 2; break;
case 'd': move.x2 = 3; break;
case 'e': move.x2 = 4; break;
case 'f': move.x2 = 5; break;
case 'g': move.x2 = 6; break;
case 'h': move.x2 = 7; break;
default: return false;
}
switch(to[1])
{
case '1': move.y2 = 0; break;
case '2': move.y2 = 1; break;
case '3': move.y2 = 2; break;
case '4': move.y2 = 3; break;
case '5': move.y2 = 4; break;
case '6': move.y2 = 5; break;
case '7': move.y2 = 6; break;
case '8': move.y2 = 7; break;
default: return false;
}
//if it contains exactly one 'x' it is a capture
return true;
}