-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinMaxTree-old.java
532 lines (390 loc) · 12.5 KB
/
MinMaxTree-old.java
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
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import aiproj.fencemaster.Move;
import aiproj.fencemaster.Piece;
public class MinMaxTree implements Piece {
private Node parent;
private Move idealMove;
private int player, opponent;
private int count = 0;
protected Gameboard gb;
protected double base = 3;
public MinMaxTree(Gameboard gb, int player) {
this.idealMove = new Move(player, false, 0, 0);
this.parent = new Node(1, new Move());
this.player = player;
this.gb = gb;
if (player == BLACK) {
opponent = WHITE;
} else if (player == WHITE) {
opponent = BLACK;
}
}
public void runMiniMax() {
createTree();
//createTree2(this.parent, this.player, 0);
alphaBetaSearch();
}
protected void createTree2(Node node, int playerValue, int ply) {
for (List<Hexagon> tempList : this.gb.getBoard()) {
for (Hexagon tempHex : tempList) {
if (tempHex == null)
continue;
Move tempMove = new Move();
tempMove.Row = tempHex.getRow();
tempMove.Col = tempHex.getColumn();
tempMove.P = playerValue;
Node tempNode = new Node(ply + 1, tempMove);
node.children.add(tempNode);
tempNode.setParent(node);
if (ply + 1 <= 3) {
createTree2(tempNode, swapValue(playerValue), ply + 1);
} else {
return;
}
}
}
}
protected int swapValue(int playerValue) {
if (playerValue == WHITE)
return BLACK;
else
return WHITE;
}
protected void setBoardValues(Gameboard board){
List<List<Hexagon>> hexBoard = board.getBoard();
for(List<Hexagon> tempList: hexBoard){
for(Hexagon tempHex: tempList){
if(tempHex.getIsEdge() && !tempHex.isCorner())
tempHex.setPriority(10);
}
}
}
protected void createTree() {
int nextPlayer = opponent;
Queue<Node> treeQueue = new LinkedList<Node>();
WinChecker winCheck = new WinChecker();
treeQueue.add(parent);
while (!treeQueue.isEmpty()) {
Node currentNode = treeQueue.poll();
if (currentNode.getMove().Row != -1
&& currentNode.getMove().Col != -1) {
gb.updateBoard(currentNode.getMove());
if (winCheck.getWin(gb) >= 0) {
gb.revertBoard(currentNode.getMove());
continue;
}
gb.revertBoard(currentNode.getMove());
}
// Restricting the depth to which we will create the tree
if (currentNode.getPly() > 3) {
break;
}
for (List<Hexagon> tempList : this.gb.getBoard()) {
for (Hexagon tempHex : tempList) {
if (tempHex == null) {
continue;
}
if (tempHex.getValue() == EMPTY) {
if (currentNode.getPly() % 2 == 0) {
nextPlayer = opponent;
} else if (currentNode.getPly() % 2 == 1) {
nextPlayer = player;
}
Move nextMove = new Move(nextPlayer, false,
tempHex.getRow(), tempHex.getColumn());
Node newNode = new Node(currentNode.getPly() + 1,
nextMove);
newNode.setParent(currentNode);
currentNode.children.add(newNode);
treeQueue.add(newNode);
tempHex.setValue(EMPTY);
}// End of if statement
}// End of inner ForLoop
}// End of outer ForLoop
// currentNode.printChildren();
}// End of While Loop
}// End of Create Tree Function
// The minimax recursive algorithm enclosed by the searchTree function was
// adapted from "Artificial Intelligence: A
// Modern Approach" by Stuart Russell and Peter Norvig.
protected Move alphaBetaSearch() {
@SuppressWarnings("unused")
double value = maxValue(this.parent, Double.NEGATIVE_INFINITY,
Double.POSITIVE_INFINITY);
double maxVal = Double.NEGATIVE_INFINITY;
Move idealMove = new Move();
for (Node tempNode : this.parent.children) {
// System.out.println("eval value for child : " +
// evalFunc(tempNode));
if (tempNode.getEvalValue() > maxVal && this.gb.getBoard().get(tempNode.getMove().Row).get(tempNode.getMove().Col).getValue() == 0) {
idealMove = tempNode.getMove();
maxVal = tempNode.getEvalValue();
// System.out.println("We are setting the ideal move to " + idealMove.Row + " , " + idealMove.Col + "for evaluation value " + maxVal);
}
}
return idealMove;
}
protected Double maxValue(Node currentNode, Double alpha, Double beta) {
Double value;
Double maxVal = Double.NEGATIVE_INFINITY;
boolean updatedParent = false;
boolean updatedChild = false;
if (currentNode.getPly() > 1 || currentNode.children.isEmpty()) {
Move parentMove = currentNode.getParent().getMove();
Move currentMove = currentNode.getMove();
if (parentMove.Row != -1 && parentMove.Col != -1)
updatedParent = this.gb.updateBoard(parentMove);
if (currentMove.Row != -1 && currentMove.Col != -1)
updatedChild = this.gb.updateBoard(currentMove);
if(updatedChild)
currentNode.setEvalValue(evalFunc(this.gb));
if (parentMove.Row != -1 && parentMove.Col != -1 && updatedParent)
this.gb.revertBoard(parentMove);
if (currentMove.Row != -1 && currentMove.Col != -1 && updatedChild)
this.gb.revertBoard(currentMove);
return currentNode.getEvalValue();
}
value = Double.NEGATIVE_INFINITY;
for (Node tempNode : currentNode.children) {
value = Math.max(value, minValue(tempNode, alpha, beta));
if (value > maxVal) {
maxVal = value;
}
currentNode.setEvalValue(maxVal);
if (value >= beta) {
return value;
}
alpha = Math.max(alpha, value);
}
return value;
}
protected Double minValue(Node currentNode, Double alpha, Double beta) {
Double value;
Double minVal = Double.POSITIVE_INFINITY;
boolean updatedParent = false;
boolean updatedChild = false;
if (currentNode.getPly() > 1 || currentNode.children.isEmpty()) {
// this.gb.updateBoard(currentNode.getParent().getParent().getMove());
Move parentMove = currentNode.getParent().getMove();
Move currentMove = currentNode.getMove();
if(parentMove.Row != -1){
Move superMove = currentNode.getParent().getParent().getMove();
}
if (parentMove.Row != -1 && parentMove.Col != -1)
updatedParent = this.gb.updateBoard(parentMove);
if (currentMove.Row != -1 && currentMove.Col != -1)
updatedChild = this.gb.updateBoard(currentMove);
if(updatedChild)
currentNode.setEvalValue(evalFunc(this.gb));
if (parentMove.Row != -1 && parentMove.Col != -1 && updatedParent)
this.gb.revertBoard(parentMove);
if (currentMove.Row != -1 && currentMove.Col != -1 && updatedChild)
this.gb.revertBoard(currentMove);
return currentNode.getEvalValue();
}
value = Double.POSITIVE_INFINITY;
for (Node tempNode : currentNode.children) {
value = Math.min(value, maxValue(tempNode, alpha, beta));
if (value < minVal) {
minVal = value;
}
currentNode.setEvalValue(minVal);
if (value <= alpha) {
return value;
}
beta = Math.min(beta, value);
}
return value;
}
private Double evalFunc(Gameboard gb) {
// System.out.println("Tripod eval for player " + this.player + " returns " + tripodEval(gb, this.player));
// System.out.println("Tripod eval for opponent " + this.opponent + " returns " + tripodEval(gb, this.opponent));
Double heuristicVal = (tripodEval(gb, this.player) - tripodEval(
gb, this.opponent))
+ (loopEval(gb, this.player) - loopEval(gb, this.opponent));
//gb.printBoard(System.out);
// System.out.println("Heuristic Value = " + heuristicVal);
return heuristicVal;
}
private double tripodEval(Gameboard board, int player) {
count++;
List<List<Hexagon>> hexBoard = board.getBoard();
WinChecker winCheck = new WinChecker();
int minIndex = 0;
int minPriority = Integer.MAX_VALUE;
int counter = 0;
// board.printBoard(System.out);
if (winCheck.tripodWin(board, player)) {
System.out.println("A tripod win has been detected for " + player);
board.printBoard(System.out);
return 10000;
}
int opponent = 0;
// Determining the colour of the opponent
if (player == WHITE) {
opponent = BLACK;
} else if (player == BLACK) {
opponent = WHITE;
}
int number = 0, minNum = Integer.MIN_VALUE, order = 1;
int[] edgeCounter = new int[6];
for (int i = 0; i < 6; i++) {
edgeCounter[i] = 0;
}
// Comparator<Hexagon> comparator = new HexagonComparator();
ArrayList<Hexagon> hexQueue = new ArrayList<Hexagon>();
for (List<Hexagon> tempList : hexBoard) {
innerloop: for (Hexagon tempHex : tempList) {
if (tempHex == null) {
continue innerloop;
}
tempHex.setPriorityValue(player, hexBoard);
if (tempHex.getValue() != player) {
continue innerloop;
} else if (tempHex.getChecked() != 0) {
continue innerloop;
}
if (tempHex.getValue() == player) {
hexQueue.add(tempHex);
}
while (!hexQueue.isEmpty()) {
counter = 0;
minIndex = 0;
for(Hexagon minHex: hexQueue){
if(minHex.getPriorityValue() < minPriority){
minPriority = minHex.getPriorityValue();
minIndex = counter;
}
counter++;
}
Hexagon currentHex = hexQueue.get(minIndex);
hexQueue.remove(minIndex);
for (Coordinate coords : currentHex.adjacencies) {
if (coords.getRow() == 999 || coords.getColumn() == 999) {
continue;
}
Hexagon nextHex = hexBoard.get(coords.getRow()).get(
coords.getColumn());
if (nextHex.getValue() == opponent) {
continue;
} else if (hexQueue.contains(nextHex)) {
continue;
} else if (nextHex.getChecked() != 0) {
continue;
} else if (nextHex.getIsEdge() && !nextHex.isCorner()) {
int j = nextHex.whichEdge();
if (j != -1) {
if (edgeCounter[j] == 1)
continue;
}
} else if(nextHex.isCorner()){
continue;
}
nextHex.setPriorityValue(player, hexBoard);
hexQueue.add(nextHex);
}// End of adjacency loop
//
// hexQueue.comparator();
if (currentHex.getValue() == EMPTY) {
number++;
}
currentHex.setChecked(order);
order++;
int k = currentHex.whichEdge();
if(k >0){
edgeCounter[k] = 1;
}
int sum = 0;
for (int i = 0; i < 6; i++) {
sum += edgeCounter[i];
}
if (sum >= 3) {
// Possible tripod
while (!hexQueue.isEmpty()) {
// hexQueue.poll();
hexQueue.clear();
}
break;
}
}// End of While Loop
for(int x = 0; x < 6; x++){
edgeCounter[x] = 0;
}
if (number > minNum) {
minNum = number;
}
number = 0;
}// End of inner for loop
}// End of outer for loop
// System.out.println("minnum = " + minNum);
// System.out.println("##################################");
// board.printPriorityBoard(System.out);
// System.out.println("##################################");
resetTreeEval(hexBoard);
if (minNum == 0)
return 0;
else
return 100 / minNum;
}// End of tripodEval
private void resetTreeEval(List<List<Hexagon>> hexBoard) {
for (List<Hexagon> tempList : hexBoard) {
for (Hexagon tempHex : tempList) {
if (tempHex == null) {
continue;
}
tempHex.resetPriorityValue();
tempHex.setChecked(0);
tempHex.setParent(null);
}
}
}
private double loopEval(Gameboard board, int playerValue) {
WinChecker winCheck = new WinChecker();
// board.printBoard(System.out);
if (winCheck.loopWin(board, playerValue)) {
System.out.println("A loop win has been detected for " + playerValue);
board.printBoard(System.out);
return 10000;
} else {
return 0;
}
}
protected Move getMove() {
System.out.println(count);
return this.idealMove;
}
// public class HexagonComparator implements Comparator<Hexagon> {
//
// @Override
// public int compare(Hexagon h1, Hexagon h2) {
//
// return h1.getPriorityValue() - h2.getPriorityValue();
// }
//
// }
public void printTree(){
List<Node> nodeList = this.parent.children;
PrintStream output = null;
try {
output = new PrintStream(new FileOutputStream("output.txt"));
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
for(Node tempNodeUpper: nodeList){
output.println("PARENT :" + tempNodeUpper.getMove().Row + " , " + tempNodeUpper.getMove().Col + " = " + tempNodeUpper.getMove().P);
for(Node tempNodeLower: tempNodeUpper.children){
output.println("CHILD :" + tempNodeLower.getMove().Row + " , " + tempNodeLower.getMove().Col + " = " + tempNodeLower.getMove().P);
for(Node tempNodeLowest: tempNodeLower.children){
output.println("BABY :" + tempNodeLowest.getMove().Row + " , " + tempNodeLowest.getMove().Col + " = " + tempNodeLowest.getMove().P);
}
}
}
}
}