-
Notifications
You must be signed in to change notification settings - Fork 0
/
MancalaImp.java
166 lines (144 loc) · 4.73 KB
/
MancalaImp.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
import java.util.LinkedList;
import java.util.Queue;
/**
* A class that implements a Mancala agent
* by implementing the MancalaAgent interface.
* @author Bruce How (22242664)
*/
public class MancalaImp implements MancalaAgent {
private final String agentName = "Bruce";
private int[] simulateMiniMax(int[] board, int move, boolean isMax) {
int seeds = board[move];
board[move] = 0; // Pick up all seeds from current house
int temp = 0;
// Simulate seed sowing
for (int i = 0; i < seeds; i++) {
int houseSeed = move + i + 1;
if (isMax) {
if (houseSeed < 6 && (i + 1) == seeds && board[houseSeed] == 0) {
board[6] += board[12 - houseSeed] + 1;
board[12 - houseSeed] = 0;
break;
} else if (houseSeed >= 13) {
board[temp++] += 1;
} else {
board[houseSeed] += 1;
}
} else {
if (houseSeed > 6 && houseSeed < 13 && i+1 == seeds && board[i+1] == 0) {
board[6] += board[12 - houseSeed] + 1;
board[12 - houseSeed] = 0;
break;
} else if (houseSeed > 13) {
if (temp == 6) {
temp++;
board[temp++] += 1;
continue;
}
board[temp++] += 1;
} else if (houseSeed < 13) {
board[houseSeed] += 1;
}
}
}
return board;
}
private int miniMax(int[] board, boolean isMax, int top, int depth, int limit, int max, int min) {
if (depth > limit) {
return board[13] - board[6];
}
Queue<Integer> moves = new LinkedList<>();
int store = 0;
if (isMax) {
store = Integer.MIN_VALUE; // Sets the current best value to the minimum int
for (int i = 0; i < 6; i++) {
if (board[i] != 0) {
moves.add(i);
}
}
} else {
store = Integer.MAX_VALUE; // Vice versa to maximum int
for (int i = 7; i < 13; i++) {
if (board[i] != 0) {
moves.add(i);
}
}
}
// Run MiniMax simulation
while (!moves.isEmpty()) {
top = moves.remove();
int opt = board[top] + top;
board = simulateMiniMax(board, top, isMax);
if (isMax && opt == 6) {
isMax = false;
} else if (!isMax && opt == 13) {
isMax = true;
}
isMax = !isMax;
int seeds = miniMax(board, isMax, top, depth + 1, limit, max, min);
// Filter better Minimax values
if (isMax) {
store = Math.max(store, seeds);
if (store >= min) {
return top;
}
store = Math.max(store, min);
} else {
store = Math.min(store, seeds);
if (store <= max) {
return top;
}
min = Math.min(store, min);
}
}
return top;
}
private int move(int[] board, boolean isMax, int limit) {
Queue<Integer> moves = new LinkedList<>();
int result = -1;
int bestSeeds = 0;
if (isMax) {
bestSeeds = Integer.MIN_VALUE;
for (int i = 0; i < 6; i++) {
if (board[i] != 0) {
moves.add(i);
}
}
} else {
bestSeeds = Integer.MAX_VALUE;
for (int i = 7; i < 13; i++) {
if (board[i] != 0) {
moves.add(i);
}
}
}
int current = -1;
while (!moves.isEmpty()) {
isMax = true;
current = moves.remove();
int seeds = miniMax(board, isMax, current, 1, limit, Integer.MIN_VALUE, Integer.MAX_VALUE);
// Set the best max/min values accordingly
if (isMax) {
if (seeds > bestSeeds) {
bestSeeds = seeds;
result = current;
} else if (seeds < bestSeeds) {
bestSeeds = seeds;
result = current;
}
}
}
return result;
}
@Override
public int move(int[] board) {
return move(board, true, 50);
}
@Override
public String name() {
return agentName;
}
@Override
public void reset() {
}
}