-
Notifications
You must be signed in to change notification settings - Fork 0
/
genetic_old2.h
372 lines (315 loc) · 13.4 KB
/
genetic_old2.h
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
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
#ifndef GENETIC_H
#define GENETIC_H
#include "chess.h"
#include <map>
#include <cmath>
#include <climits>
#include <cfloat>
#include <iostream>
#include <algorithm>
// Genetic variation on Turochamp -- a heuristic based algorithm developed by Alan Turing. It works similarly to the heuristic Tetris algorithm in the TETRIS repo.
class ChessAI {
public:
// Instance variables are coefficients. The descriptions are what each coefficient is scaled by when computing the score.
// X X P N B R Q K
double values[8] = {0, 0, 1, 3, 3, 5, 9, 1000};
double mob = 1; // Mobility of pieces excluding kings and pawns
double rbndef = 1; // RBN defense counter
double qdef = 1; // Queen defense counter
double kmob = 1; // King mobility excludes castles
double kdef = -1; // If the king is undefended we deduct some points.
double oo = 1; // Castling -- add 1 point if castling is possible, another if castling is a legal move right now or has been done just now.
double chk = 1; // Checks (don't worry about checkmates for now)
double ckmt = 1000; // Checkmate value that replaces the check value upon the threat of a mate
double movecount = -0.01;
ChessAI() {
mob = 1;
rbndef = 1;
qdef = 1;
kmob = 1;
kdef = -1;
oo = 1;
chk = 1;
ckmt = 1000;
movecount = -0.01;
}
ChessAI(const ChessAI& other) {
mob = other.mob;
rbndef = other.rbndef;
qdef = other.qdef;
kmob = other.kmob;
kdef = other.kdef;
oo = other.oo;
chk = other.chk;
ckmt = other.ckmt;
movecount = other.movecount;
}
ChessAI(int m, int r, int q, int km, int kd, int o, int ch, int cm, int mc) {
mob = m;
rbndef = r;
qdef = q;
kmob = km;
kdef = -kd;
oo = o;
chk = ch;
ckmt = cm;
movecount = mc;
}
float getOneSidedScore(ChessGame game, bool verbose = false) {
double material = 0;
/*
if (verbose) std::cout << "{" << game.captures.size() << "}";
for (auto i : game.captures) {
// if (verbose) std::cout << i.toString() << " ";
material += values[i.getID()];
}
if (verbose) std::cout << "<<<\n";
*/
for (int x = 0; x < 8; x++) {
for (int y = 0; y < 8; y++) {
ChessPiece piece = game.board[x][y];
if (!piece.isEmpty() && piece.getColor() == game.sidetomove) material += values[piece.getID()];
}
}
std::vector<std::pair<std::pair<int, int>, std::pair<int, int>>> legals = game.getAllLegalMoves();
std::vector<std::pair<std::pair<int, int>, std::pair<int, int>>> defs = game.getDefenses();
double mobs = 0;
std::map<std::pair<int, int>, int> pmoves;
for (auto p : legals) {
ChessPiece source = game.board[p.first.first][p.first.second];
if (source.isPawn() || source.isKing() || source.isEmpty()) continue;
if (pmoves.find(p.first) == pmoves.end()) pmoves.insert({p.first, 0});
(*(pmoves.find(p.first))).second++;
}
int kmobs = 0;
for (auto p : legals) {
ChessPiece source = game.board[p.first.first][p.first.second];
if (source.isKing() && abs(p.second.second) != 2) kmobs++;
}
for (auto p : pmoves) mobs += std::sqrt((double)(p.second));
int rbndefs = 0;
int qdefs = 0;
int kdefcnt = 0;
for (auto p : defs) {
ChessPiece source = game.board[p.second.first][p.second.second];
if (source.isBishop() || source.isRook() || source.isKnight()) rbndefs++;
if (source.isQueen()) qdefs++;
if (source.isKing()) kdefcnt++;
}
int kdefs = 0;
int you = (game.sidetomove) ? (1<<0) : (1<<1);
if (kdefcnt == 0) {
for (auto p : game.getAllPieces(you | (1<<7))) {
int dx[8] = {00, 01, 01, 01, 00, -1, -1, -1};
int dy[8] = {01, 01, 00, -1, -1, -1, 00, 01};
for (int i = 0; i < 8; i++) {
for (int k = 1; k < 9; k++) {
std::pair<int, int> des = {p.file() + dx[i] * k, p.rank() + dy[i] * k};
if (!game.inBounds(des)) break;
ChessPiece x = game.board[des.first][des.second];
if (!x.isEmpty()) break;
kdefs++;
}
}
}
}
ChessGame game2(game);
game2.sidetomove = !game.sidetomove;
int checks = (game2.noChecks()) ? 0 : 1;
if (game2.checkmate()) checks = ckmt;
int oos = 0;
if (verbose) std::cout << "AI ANALYSIS " << material << " " << mobs << " " << kmobs << " " << rbndefs << " " << qdefs << " " << kdefs << " " << oos << " " << checks << "\n";
int movecnt = game.halfmoveclock;
return material + mobs * mob + kmob * kmobs + rbndef * rbndefs + qdef * qdefs + kdef * kdefs + chk * checks - movecnt * movecount;
}
double getScore(ChessGame game, bool verbose = false) {
double res = getOneSidedScore(game, verbose);
ChessGame game2(game);
game2.sidetomove = !game2.sidetomove;
res -= getOneSidedScore(game2, verbose);
return res;
}
// Maximizes your score after moving (opponent can do stuff later to lower it however)
std::pair<std::pair<int, int>, std::pair<int, int>> pickdepth1(ChessGame game, bool verbose = false) {
std::vector<std::pair<std::pair<int, int>, std::pair<int, int>>> legals = game.getAllLegalMoves();
if (legals.size() == 0) return {std::make_pair(-1, -1), std::make_pair(0, 0)};
std::pair<std::pair<int, int>, std::pair<int, int>> res = legals[0];
double maxscore = -1 * DBL_MAX;
for (auto p : legals) {
if (verbose) std::cout << "[" << p.first.first << " " << p.first.second << " > " << p.second.first << " " << p.second.second << "]\n";
ChessGame game2(game);
game2.execute(p.first, p.second);
if (verbose) for (auto i : game2.captures) std::cout << i.toString() << " ";
if (verbose) std::cout << "---\n";
double score = getScore(game2, verbose);
if (score > maxscore) {
maxscore = score;
res = p;
}
if (score == maxscore) {
if (rand() % 2 == 0) {
maxscore = score;
res = p;
}
}
}
return res;
}
// Minimizes the score of the opponent after moving
std::pair<std::pair<int, int>, std::pair<int, int>> minoppd1(ChessGame game, bool verbose = false, int maxcons = 16) {
std::vector<std::pair<std::pair<int, int>, std::pair<int, int>>> legals = game.getAllLegalMoves();
if (legals.size() == 0) return {std::make_pair(-1, -1), std::make_pair(0, 0)};
std::pair<std::pair<int, int>, std::pair<int, int>> res = legals[0];
double maxscore = DBL_MAX;
std::random_shuffle(legals.begin(), legals.end());
for (int i = 0; i < maxcons && i < legals.size(); i++) {
auto p = legals[i];
if (verbose) std::cout << "[" << p.first.first << " " << p.first.second << " > " << p.second.first << " " << p.second.second << "]\n";
ChessGame game2(game);
game2.execute(p.first, p.second);
if (verbose) for (auto i : game2.captures) std::cout << i.toString() << " ";
if (verbose) std::cout << "---\n";
game2.sidetomove = !game2.sidetomove;
double score = getScore(game2, verbose);
if (score < maxscore) {
maxscore = score;
res = p;
}
if (score == maxscore) {
if (rand() % 2 == 0) {
maxscore = score;
res = p;
}
}
}
return res;
}
// Minimaxes the opponent's response (so basically it picks the move such that if the opponent responds in a way that gives you the worst outcome this worst outcome is lessened).
std::pair<std::pair<int, int>, std::pair<int, int>> pickdepth2(ChessGame game, bool verbose = false, int maxcons = 16) {
std::vector<std::pair<std::pair<int, int>, std::pair<int, int>>> legals = game.getAllLegalMoves();
// for (auto i : legals) std::cout << "[" << i.first.first << " " << i.first.second << " " << i.second.first << " " << i.second.second << "]";
// std::cout << "\n";
if (legals.size() <= 0) {
// std::cout << "PICK FAILED\n";
return {std::make_pair(-1, -1), std::make_pair(0, 0)};
}
std::pair<std::pair<int, int>, std::pair<int, int>> res = legals[0];
double maxscore = -1 * DBL_MAX;
int x = 0;
// std::cout << "PICKING MOVE...\n";
// std::random_shuffle(legals.begin(), legals.end());
for (int i = 0; i < legals.size() && i < maxcons; i++) {
// std::cout << i << " ";
ChessGame game2(game);
game2.execute(legals[i].first, legals[i].second);
game2.sidetomove = !game2.sidetomove;
auto oppmove = minoppd1(game2, verbose);
game2.execute(oppmove.first, oppmove.second);
game2.sidetomove = !game2.sidetomove;
double score = getScore(game, verbose);
if (score >= maxscore) {
maxscore = score;
res = std::make_pair(legals[i].first, legals[i].second);
}
if (score == maxscore) {
if (rand() % 2 == 0) res = std::make_pair(legals[i].first, legals[i].second);
}
}
// std::cout << "\nMOVE PICKED\n";
return res;
}
std::pair<std::pair<int, int>, std::pair<int, int>> pick(ChessGame game, bool verbose = false) {
return minoppd1(game, false);
}
// mob / rbndef / qdef / kmob / kdef / oo / chk / ckmt / movecount
std::string toString() {
std::string res = "MOB " + std::to_string(mob) + " RBN " + std::to_string(rbndef) + " QDEF " + std::to_string(qdef);
res = res + " KMOB " + std::to_string(kmob) + " KDEF " + std::to_string(kdef) + " OO " + std::to_string(oo);
res = res + " CHK " + std::to_string(chk) + " CKMT " + std::to_string(ckmt) + " MCNT " + std::to_string(movecount);
return res;
}
};
namespace Genetic {
// Play with a1 white and a2 black
int test(ChessAI a1, ChessAI a2, bool verbose = false) {
ChessGame game;
while (true) { // a1 white a2 black
auto move = game.sidetomove ? (a1.pick(game)) : (a2.pick(game));
game.execute(move.first, move.second);
game.sidetomove = !game.sidetomove;
// if (verbose) std::cout << game.toString() << "\n";
if (game.checkmate()) {
if (verbose) std::cout << game.toString() << "\n";
if (verbose) std::cout << ( game.sidetomove ? "BLACK" : "WHITE" ) << " WINS\n";
return game.sidetomove ? (-1) : (1);
}
if (game.stalemate()) {
if (verbose) std::cout << game.toString() << "\n";
if (verbose) std::cout << "STALEMATE/DRAW\n";
return 0;
}
}
}
std::vector<ChessAI> tournament(std::vector<ChessAI> ais, bool verbose = false) {
std::random_shuffle(ais.begin(), ais.end());
std::vector<ChessAI> res;
for (int i = 0; i < ais.size() - 1; i += 2) {
int val = test(ais[i], ais[i + 1]);
if (val > 0) res.push_back(ChessAI(ais[i]));
else if (val < 0) res.push_back(ChessAI(ais[i + 1]));
else {
if (rand() % 2 == 0) res.push_back(ChessAI(ais[i]));
else res.push_back(ChessAI(ais[i + 1]));
}
if (verbose) std::cout << "X";
}
if (verbose) std::cout << "\n";
return res;
}
// mob / rbndef / qdef / kmob / kdef / oo / chk / ckmt / movecount
ChessAI cross(ChessAI a1, ChessAI a2) {
ChessAI res(a1);
if (rand() % 2 == 0) res.mob = a2.mob;
if (rand() % 2 == 0) res.rbndef = a2.rbndef;
if (rand() % 2 == 0) res.qdef = a2.qdef;
if (rand() % 2 == 0) res.kmob = a2.kmob;
if (rand() % 2 == 0) res.kdef = a2.kdef;
if (rand() % 2 == 0) res.oo = a2.oo;
if (rand() % 2 == 0) res.chk = a2.chk;
if (rand() % 2 == 0) res.ckmt = a2.ckmt;
if (rand() % 2 == 0) res.movecount = a2.movecount;
return res;
}
double randf() {
return (double)(rand()) / RAND_MAX;
}
// mob / rbndef / qdef / kmob / kdef / oo / chk / ckmt / movecount
ChessAI mutate(ChessAI ai) {
ChessAI res(ai);
int beep = rand() % 64;
if (beep == 0) res.mob = randf() * 4 - 2;
if (beep == 1) res.rbndef = randf() * 4 - 2;
if (beep == 2) res.qdef = randf() * 4 - 2;
if (beep == 3) res.kmob = randf() * 4 - 2;
if (beep == 4) res.kdef = randf() * -4 + 2;
if (beep == 5) res.oo = randf() * 4 - 2;
if (beep == 6) res.chk = randf() * 4 - 2;
// if (beep == 7) res.ckmt = randf() * 400;
if (beep == 8) res.movecount = (0.5 - randf()) * 0.5;
return res;
}
ChessAI randomAI() {
ChessAI res;
res.mob = randf() * 4 - 2;
res.rbndef = randf() * 4 - 2;
res.qdef = randf() * 4 - 2;
res.kmob = randf() * 4 - 2;
res.kdef = randf() * -4 + 2;
res.oo = randf() * 4 - 2;
res.chk = randf() * 4 - 2;
// if (beep == 7) res.ckmt = randf() * 400;
res.movecount = (0.5 - randf()) * 0.5;
return res;
}
}
#endif