-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathteam4.py
More file actions
266 lines (242 loc) · 8.39 KB
/
team4.py
File metadata and controls
266 lines (242 loc) · 8.39 KB
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
import random
from time import time
import copy
INF = 1e10
class Team4:
def __init__(self):
self.time_limit = 15
self.max_depth = 100
self.time_out = 0
self.depth = 6
self.cell_weight = [6, 4, 4, 6, 4, 3, 3, 4, 4, 3, 3, 4, 6, 4, 4, 6]
self.mapping_x = {'x':1, 'o':-1, 'd':0, '-':0}
self.mapping_o = {'x':-1, 'o':1, 'd':0, '-':0}
def move(self, board, old_move, flag):
self.time_start = time()
self.time_out = 0
tmp = copy.deepcopy(board.block_status)
bestret_cell = random.choice(board.find_valid_move_cells(old_move))
board.update(old_move, bestret_cell, flag)
bestval = self.heuristic(board, old_move, flag)
board.block_status = copy.deepcopy(tmp)
board.board_status[bestret_cell[0]][bestret_cell[1]] = '-'
for i in xrange(3,self.max_depth+1):
self.depth = i
ret = self.alpha_beta(board, -INF, INF, 0, old_move, flag)
if (ret[0] > bestval):
bestval = ret[0]
bestret_cell = ret[1]
print "ret at i", i, " is ", ret
if self.time_out == 1:
break
print board.print_board()
return bestret_cell
def alpha_beta(self, board, alpha, beta, depth, old_move, flag):
available_cells = board.find_valid_move_cells(old_move)
if (len(available_cells) == 0):
if (flag == 'x'):
return -INF, (0, 0)
else:
return INF, (0, 0)
random.shuffle(available_cells)
# print available_cells
if (flag == 'x'):
tmp = copy.deepcopy(board.block_status)
ans = -INF, available_cells[0]
ret = -INF, (0, 0)
for cell in available_cells:
if (time() - self.time_start >= self.time_limit):
self.time_out = 1
break
# print cell
board.update(old_move, cell, flag)
# print "--------------------------------------------------BEFORE-----------------------------------------"
# print board.print_board()
if board.find_terminal_state()[0] == 'o':
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
continue;
elif board.find_terminal_state()[0] == 'x':
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
ans = INF, cell
return ans
elif (depth >= self.depth and len(board.find_valid_move_cells(old_move)) > 0):
ret1 = self.heuristic(board, old_move, 'x'), cell
ret2 = self.heuristic(board, old_move, 'o'), cell
ret = ret1[0]-ret2[0], cell
# board.print_board()
# print "ret is ", ret
elif (depth < self.depth):
ret = self.alpha_beta(board, alpha, beta, depth+1, cell, 'o')
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
# print "--------------------------------------------------AFTER-----------------------------------------"
# print board.print_board()
### print "ret[0] here is ", ret[0]
if (ret[0] > ans[0]):
## # print "ret[0] ", ret[0], "cell ", cell
ans = ret[0], cell
if (ans[0] >= beta):
break
alpha = max(alpha, ans[0])
### print "ans is ", ans, " flag ", flag , " depth ", depth
return ans
elif (flag == 'o'):
tmp = copy.deepcopy(board.block_status)
ans = INF, available_cells[0]
ret = INF, (0, 0)
for cell in available_cells:
if (time() - self.time_start >= self.time_limit):
self.time_out = 1
break
# print cell
board.update(old_move, cell, flag)
# print "--------------------------------------------------BEFORE-----------------------------------------"
# print board.print_board()
if board.find_terminal_state()[0] == 'x':
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
continue;
elif board.find_terminal_state()[0] == 'o':
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
ans = INF, cell
return ans
elif (depth >= self.depth and len(board.find_valid_move_cells(old_move)) > 0):
ret1 = self.heuristic(board, old_move, 'o'), cell
ret2 = self.heuristic(board, old_move, 'x'), cell
ret = ret1[0]-ret2[0], cell
# board.print_board()
# print "ret is ", ret
elif (depth < self.depth):
ret = self.alpha_beta(board, alpha, beta, depth+1, cell, 'x')
board.board_status[cell[0]][cell[1]] = '-'
board.block_status = copy.deepcopy(tmp)
# print "--------------------------------------------------AFTER-----------------------------------------"
# print board.print_board()
### print "ret[0] here is ", ret[0]
if (ret[0] < ans[0]):
ans = ret[0], cell
if (ans[0] <= alpha):
break
beta = min(beta, ans[0])
###print "ans is ", ans, " flag ", flag , " depth ", depth
return ans
def heuristic(self, board, old_move, flag):
goodness = 0
goodness += self.calc_single_blocks(board, old_move, flag)
goodness += (self.calc_as_whole(board, old_move, flag)*200)
# print "goodness is ", goodness
return goodness
def calc_single_blocks(self, board, old_move, flag):
block_goodness = 0
for i in xrange(4):
for j in xrange(4):
block_goodness += self.calc_per_block(board, old_move, i, j, flag)
return block_goodness
def cal_diam_weight(self, centre_x, centre_y, board_status, flag):
# For a single diamond
cx = centre_x
cy = centre_y
mp = {}
if (flag == 'x'):
mp = self.mapping_x
else:
mp = self.mapping_o
a = mp[board_status[cx][cy+1]]
b = mp[board_status[cx][cy-1]]
c = mp[board_status[cx + 1][cy]]
d = mp[board_status[cx - 1][cy]]
# print "a b c d", a , b, c, d
diam_weight = 10*(a + b + c + d)
if (a == 1):
diam_weight *= 3
if (b == 1):
diam_weight *= 3
if (c == 1):
diam_weight *= 3
if (d == 1):
diam_weight *= 3
if(a == -1 or b == -1 or c == -1 or d == -1):
diam_weight = 0
return diam_weight
def calc_per_block(self, board, old_move, block_x, block_y, flag):
ret = 0
# For checking how good a row/col is
row_weight = [10, 10, 10, 10]
col_weight = [10, 10, 10, 10]
adj_row = [0, 0, 0, 0]
adj_col = [0, 0, 0, 0]
for i in xrange(4):
for j in xrange(4):
mp = {}
if (flag == 'x'):
mp = self.mapping_x
else:
mp = self.mapping_o
# print board.board_status[4&block_x+i][4*block_y+j],
mapping_val = mp[board.board_status[4*block_x+i][4*block_y+j]]
# Yes, the below line will help in the overall case
# row_weight += mapping_val * self.cell_weight probably will only help in case of overall block
if(row_weight[i] == 10):
row_weight[i] += mapping_val * 10
if(col_weight[j] == 10):
col_weight[j] += mapping_val * 10
if (mapping_val == -1):
row_weight[i] = 0
col_weight[j] = 0
# Preferring more number of x's in a single line(row or column)
if (mapping_val != 0):
row_weight[i] *= 3
col_weight[j] *= 3
# print
# For checking how good diamond state is
diam_weight = [[0, 0], [0, 0]]
for i in xrange(2):
for j in xrange(2):
diam_weight[i][j] = self.cal_diam_weight(4*block_x + 1 + i, 4*block_y + 1 + j, board.board_status, flag)
# print "diam_weight ", i, j, " is ", diam_weight[i][j]
ret += diam_weight[i][j]
for i in xrange(3):
# print "row_weight ", i, " is ", row_weight[i]
# print "col_weight ", i, " is ", col_weight[i]
ret += row_weight[i]
ret += col_weight[i]
# print "blockx ", block_x, " block_y ", block_y, " perblock ", ret
return ret
def calc_as_whole(self, board, old_move, flag):
ret = 0
# For checking how good a row/col is
row_weight = [10, 10, 10, 10]
col_weight = [10, 10, 10, 10]
for i in xrange(4):
for j in xrange(4):
mp = {}
if (flag == 'x'):
mp = self.mapping_x
else:
mp = self.mapping_o
mapping_val = mp[board.block_status[i][j]]
row_weight += mapping_val * self.cell_weight # probably will only help in case of overall block
if(row_weight[i] == 10):
row_weight[i] += mapping_val * 10
if(col_weight[j] == 10):
col_weight[j] += mapping_val * 10
if (mapping_val == -1):
row_weight[i] = 0
col_weight[j] = 0
if (mapping_val != 0):
row_weight[i] *= 3
col_weight[j] *= 3
# For checking how good diamond state is
diam_weight = [[0, 0], [0, 0]]
for i in xrange(2):
for j in xrange(2):
diam_weight[i][j] = self.cal_diam_weight(i, j, board.block_status, flag)
ret += diam_weight[i][j]
for i in xrange(3):
ret += row_weight[i]
ret += col_weight[i]
# print "as a whole ", ret
return ret