-
Notifications
You must be signed in to change notification settings - Fork 0
/
bot.c
240 lines (143 loc) · 4.18 KB
/
bot.c
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
#include "l_header.h"
#include "f_header.h"
int minimax(char **board, int size, int x, int y, int difficulty, int maximize, int user) {
int finalEval, i, j, eval;
/* Board Copy */
char **copy;
copy = malloc(size * sizeof(char *));
for(i = 0 ; i < size ; i++) {
*(copy + i) = malloc(size * sizeof(char));
}
for(i = 0 ; i < size ; i++) {
for(j = 0 ; j < size ; j++) {
copy[i][j] = board[i][j];
}
}
if(difficulty) {
if(maximize) {
finalEval = -99999;
/* For all possible moves player can make */
for(i = 0 ; i < size ; i++) {
for(j = 0 ; j < size ; j++) {
if(copy[i][j] == 'n') {
if(!user) //user is white player
copy[i][j] = 'w';
else
copy[i][j] = 'b';
eval = minimax(copy, size, i, j, difficulty - 1, 0, user);
copy[i][j] = 'n';
}
finalEval = max(finalEval, eval);
}
}
} else {//min
finalEval = 99999;
/* For all possible moves player can make */
for(i = 0 ; i < size ; i++) {
for(j = 0 ; j < size ; j++) {
if(copy[i][j] == 'n') {
if(!user) //user is white player
copy[i][j] = 'w';
else
copy[i][j] = 'b';
eval = minimax(copy, size, i, j, difficulty - 1, 1, user);
copy[i][j] = 'n';
}
finalEval = min(finalEval, eval);
}
}
}
return finalEval;
} else {
return eval1(copy, user, size);
}
}
int eval1(char **board , int user, int size) {
int *score, length1 = 0, length2 = 0;
score = malloc(sizeof(int));
/* Board Copy */
char **copy;
copy = malloc(size * sizeof(char *));
for(int z = 0 ; z < size ; z++) {
*(copy + z) = malloc(size * sizeof(char));
}
for(int z = 0 ; z < size ; z++) {
for(int k = 0 ; k < size ; k++) {
copy[z][k] = board[z][k];
}
}
/* We will find the bigest path for each player, then we will subtract the two to find the evaluation.
To find a path's length we first cycle through the board until we find a piece of the player we are searching for.
Then we empty this cell and add 1 to the length of the path while calling the next function that searches for neighbour cells */
for(int i = 0 ; i < size ; i++) { //White player biggest path length
for(int j = 0 ; j < size ; j++) {
if(copy[i][j] == 'w') {
copy[i][j] = 'n';
*score = 0;
eval2(copy, score, i, j, 'w', size);
length1 = max(length1, *score);
copy[i][j] = 'w';
}
}
}
for(int i = 0 ; i < size ; i++) { //Black player biggest path length
for(int j = 0 ; j < size ; j++) {
if(copy[i][j] == 'b') {
copy[i][j] = 'n';
*score = 0;
eval2(copy, score, i, j, 'b', size);
length2 = max(length2, *score);
copy[i][j] = 'b';
}
}
}
if(user)
return length2-length1;
else
return length1-length2;
}
void eval2(char **board, int *score, int i, int j, char piece, int size) {
/* Check "neighbour-cells" */
if(i - 1 >= 0) {
if (board[i-1][j] == piece) {
board[i-1][j] = 'n';
(*score)++;
eval2(board, score, i-1, j, piece, size) ;
}
}
if(i + 1 < size) {
if(board[i+1][j] == piece) {
board[i+1][j] = 'n';
(*score)++;
eval2(board, score, i+1, j, piece, size);
}
}
if(j - 1 >= 0) {
if(board[i][j-1] == piece) {
board[i][j-1] = 'n';
(*score)++;
eval2(board, score, i, j-1, piece, size);
}
}
if(j + 1 < size) {
if(board[i][j+1] == piece) {
board[i][j+1] = 'n';
(*score)++;
eval2(board, score, i, j+1, piece, size);
}
}
if((j + 1 < size) && (i - 1 >= 0)) {
if((board[i-1][j+1] == piece)) {
board[i-1][j+1] = 'n';
(*score)++;
eval2(board, score, i-1, j+1, piece, size);
}
}
if((j - 1 >= 0) && (i + 1 < size)) {
if(board[i+1][j-1] == piece) {
board[i+1][j-1] = 'n';
(*score)++;
eval2(board, score, i+1, j-1, piece, size);
}
}
}