-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStudentPlayer.java
214 lines (175 loc) · 4.62 KB
/
StudentPlayer.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
import java.util.ArrayList;
public class StudentPlayer extends Player{
private final int MAX_DEPTH = 7;
public StudentPlayer(int playerIndex, int[] boardSize, int nToConnect) {
super(playerIndex, boardSize, nToConnect);
}
private int miniMax(Board board, int depth, int alpha, int beta, boolean isMaxPlayer)
{
if(board.gameEnded() || depth == 0 || board.getValidSteps().isEmpty())
{
return evalPosition(board, isMaxPlayer);
}
else if(isMaxPlayer)
{
int maxEval = Integer.MIN_VALUE;
ArrayList<Integer> moves = board.getValidSteps();
for(int i = 0; i < moves.size(); i++)
{
Board copyBoard = new Board(board);
copyBoard.step(2, moves.get(i));
maxEval = Math.max(maxEval, miniMax(copyBoard, depth-1, alpha, beta, false));
alpha = Math.max(maxEval, alpha);
if(alpha >= beta)
{
break;
}
}
return maxEval;
}
else
{
int minEval = Integer.MAX_VALUE;
ArrayList<Integer> moves = board.getValidSteps();
for(int i = 0; i < moves.size(); i++)
{
Board copyBoard = new Board(board);
copyBoard.step(1, moves.get(i));
minEval = Math.min(minEval, miniMax(copyBoard, depth-1, alpha, beta, true));
beta = Math.min(minEval, beta);
if(alpha >= beta)
{
break;
}
}
return minEval;
}
}
private int evalPosition(Board board, boolean isMaxPlayer)
{
int score = 0;
if(board.getWinner() == 2)
{
score += 100;
}
else if(board.getWinner() == 1)
{
score = -20;
}
else
{
for(int i = 0; i < 7; i++)
{
for(int j = 0; j < 6; j++)
{
if(isThreeInARow(board, j, i) && isMaxPlayer)
score += 5;
else if(isTwoInARow(board, j, i) && isMaxPlayer)
score += 2;
else if(isThreeInARow(board, j, i) && !isMaxPlayer)
score -= 8;
}
}
}
for(int i = 0; i < 6; i++)
{
if(board.getState()[i][3] == 2)
{
score += 8;
}
}
return score;
}
private boolean isThreeInARow(Board board, int r, int c)
{
int rowNumber = 6;
int colNumber = 7;
int symbol = 0;
if(board.getState()[r][c] == 1)
{
symbol = 1;
}
else if(board.getState()[r][c] == 2)
{
symbol = 2;
}
if(symbol == 0)
{
return false;
}
if(r + 3 < rowNumber && board.getState()[r+1][c] == symbol && board.getState()[r+2][c] == symbol && board.getState()[r+3][c] == 0)
{
return true;
}
else if(c + 3 < colNumber && board.getState()[r][c+1] == symbol && board.getState()[r][c+2] == symbol && board.getState()[r][c+3] == 0)
{
return true;
}
else if(r + 3 < rowNumber && c + 3 < colNumber && board.getState()[r+1][c+1] == symbol && board.getState()[r+2][c+2] == symbol && board.getState()[r+3][c+3] == 0)
{
return true;
}
else if(r - 3 >= 0 && c +3 < colNumber && board.getState()[r - 1][c +1] == symbol && board.getState()[r-2][c+2] == symbol && board.getState()[r-3][c+3] == 0)
{
return true;
}
return false;
}
private boolean isTwoInARow(Board board, int r, int c)
{
int rowNumber = 6;
int colNumber = 7;
int symbol = 0;
if(board.getState()[r][c] == 1)
{
symbol = 1;
}
else if(board.getState()[r][c] == 2)
{
symbol = 2;
}
if(symbol == 0)
{
return false;
}
if(r + 2 < rowNumber && board.getState()[r+1][c] == symbol && board.getState()[r+2][c] == 0)
{
return true;
}
else if(c + 2 < colNumber && board.getState()[r][c+1] == symbol && board.getState()[r][c+2] == 0)
{
return true;
}
else if(r + 2 < rowNumber && c + 2 < colNumber && board.getState()[r+1][c+1] == symbol && board.getState()[r+2][c+2] == 0)
{
return true;
}
else if(r - 2 >= 0 && c +2 < colNumber && board.getState()[r - 1][c +1] == symbol && board.getState()[r-2][c+2] == 0)
{
return true;
}
return false;
}
@Override
public int step(Board board) {
ArrayList<Integer> moves = board.getValidSteps();
ArrayList<Integer> movesScore = new ArrayList<Integer>();
for(int i = 0 ; i < moves.size(); i++)
{
Board copyBoard = new Board(board);
copyBoard.step(2, moves.get(i));
movesScore.add(miniMax(copyBoard, MAX_DEPTH, Integer.MIN_VALUE, Integer.MAX_VALUE, false));
}
int max = Integer.MIN_VALUE;
int max_pos = 0;
for(int i = 0; i < movesScore.size(); i++)
{
if(movesScore.get(i) > max)
{
max = movesScore.get(i);
max_pos = i;
}
}
return moves.get(max_pos);
}
}