/
visminmax.py
267 lines (240 loc) · 7.67 KB
/
visminmax.py
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
import copy
from math import *
import ReversiGraphics as graphics
import ReversiBoard as rboard
testwin = graphics.Window()
board = rboard.Board(8, 8)
display = testwin.setup_display(board)
class ValuedMove():
def __init__(self, value, move):
self.value = value
self.move = move
def __lt__(self, other):
return self.value < other
def __le__(self, other):
return self.value <= other
def __gt__(self, other):
return self.value > other
def __ge__(self, other):
return self.value >= other
def __eq__(self, other):
return self.value == other
def __neg__(self):
return ValuedMove(-self.value, self.move)
def __repr__(self):
if self.move == None:
return str(self.value) + " " + "None"
else:
return str(self.value) + " " + ",".join([str(x) for x in self.move])
def endcheck(field):
black_legals = find_legal_moves(field, 1)
red_legals = find_legal_moves(field, 2)
if not black_legals and not red_legals:
return True
else:
return False
def evaluate_by_territory(field, max_token):
black, red = 0, 0
for i in range(len(field)):
for j in range(len(field[0])):
if field[i][j] == 1:
black += 1
elif field[i][j] == 2:
red += 1
if max_token == 1:
return black-red
else:
return red-black
def evaluate_by_weight(field, max_token):
weightings = ([100,-5,5,5,5,5,-5,100],
[-5,0,0,0,0,0,0,-5],
[5,0,0,0,0,0,0,5],
[5,0,0,0,0,0,0,5],
[5,0,0,0,0,0,0,5],
[5,0,0,0,0,0,0,5],
[-5,0,0,0,0,0,0,-5],
[100,-5,5,5,5,5,-5,100])
result = 0
for i in range(len(weightings)):
for j in range(len(weightings[0])):
if field[i][j] == 1:
mult = 1
elif field[i][j] == 2:
mult = -1
else: mult = 0
result += mult * weightings[i][j]
# print(result)
return result
def count_frontiers(field):
black, red = 0, 0
for i in range(len(field)):
for j in range(len(field[0])):
if field[i][j] != 0:
surrounds = [(0,1), (0,-1), (-1,0), (1,0)]
frontier = False
for s in surrounds:
cell = [i+s[0], j+s[1]]
if on_board(cell) and field[cell[0]][cell[1]] == 0:
frontier = True
if frontier:
if field[i][j] == 1: black += 1
else: red += 1
return black
def evaluate_by_mobility(field, max_token):
black_moves = len(find_legal_moves(field, 1))
red_moves = len(find_legal_moves(field, 2))
team = 1 if max_token == 1 else 2
mobility = black_moves - red_moves
return mobility * team
def mock_play(field, move, token):
if move == None:
return field
newfield = copy.deepcopy(field)
newfield[move[1]][move[0]] = token
flip_tokens(newfield, move, token)
return(newfield)
def evaluate_by_frontiers(field, max_token):
if max_token == 1:
return 1/count_frontiers(field)
elif max_token == 2:
return count_frontiers(field)
def count_frees(field):
free_tiles = 0
for i in range(len(field)):
for j in range(len(field[0])):
if field[i][j] == 0:
free_tiles += 1
return free_tiles
def evaluate_2(field, max_token):
discs = 64 - count_frees(field)
EC = 500
MC = 350 - 2 * discs
# if discs < 10:
# SC = 200 - discs
# elif discs < 20:
# SC = 190-2*(discs-10)
# elif discs < 40:
# SC = 170-5*(discs-20)
# elif discs < 50:
# SC = 70 - 7*(discs-40)
# else:
# SC = 0
def evaluate(field, max_token, tiles_left):
if tiles_left > 5:
mc = 1 #1
fc = 20 #20
ec = 1
mobility = evaluate_by_mobility(field, max_token)
frontiers = evaluate_by_frontiers(field, max_token)
edges = evaluate_by_weight(field, max_token)
# print(mobility, frontiers, edges)
# print(mobility, fc*frontiers)
return mobility*mc + fc*frontiers + ec*edges
else:
return evaluate_by_territory(field, max_token)
def inv(move):
if move == None:
return move
else:
return [move[1], move[0]]
def alphabeta(field, depth, alpha, beta, colour, token, tiles_left):
testwin.draw_board(display, board, 0)
if depth <= 0 or endcheck(field):
return ValuedMove(colour * evaluate(field, token, tiles_left), None)
value = ValuedMove(-inf, None)
sim_token = token if colour == 1 else 3-token
legals = find_legal_moves(field, sim_token)
if legals == []: legals.append(None)
# print(legals)
for move in legals:
# print(move)
newfield = mock_play(field, move, token)
value = max(value, ValuedMove(-alphabeta(newfield, depth-1, -beta,
-alpha, -colour, token, tiles_left).value, inv(move)))
alpha = max(alpha, value.value)
# print(alpha, beta, value)
if alpha >= beta:
pass
# print("alpha cutoff")
# break
return value
def order_moves(field, depth, alpha, beta, colour, token):
best_move = alphabeta(field, depth-1, alpha, beta, colour, token)
def flip_tokens(field, cell, player):
directions = []
for i in range(-1, 2):
for j in range(-1, 2):
directions.append([i,j])
directions.remove([0,0])
runs = []
for d in directions:
run = []
tested_cell = cell
ended = False
valid = True
while not ended:
run.append(tested_cell)
tested_cell = [tested_cell[n] + d[n] for n in [0,1]]
if not on_board(tested_cell):
valid = False
break
if field[tested_cell[1]][tested_cell[0]] != 3-player:
ended = True
if valid and field[tested_cell[1]][tested_cell[0]] == player:
runs.append(run)
for run in runs:
for cell in run:
field[cell[1]][cell[0]] = player
def find_neighbours(field, player):
neighbours = []
occupied_cells = []
for i in range(len(field)):
for j in range(len(field[0])):
if field[i][j] != 0:
occupied_cells.append([i,j])
surrounds = [(0,1), (0,-1), (-1,0), (1,0)]
for cell in occupied_cells:
for s in surrounds:
neighbour = [cell[i]+s[i] for i in [0,1]]
if on_board(neighbour) and field[neighbour[0]][neighbour[1]] == 0:
neighbours.append(neighbour)
return neighbours
def validate_neighbours(neighbours, field, player):
legals = []
directions = []
for i in range(-1, 2):
for j in range(-1, 2):
directions.append([i,j])
directions.remove([0,0])
for move in neighbours:
valid = False
for d in directions:
tested_cell = [move[1],move[0]]
run_length = 0
while True:
tested_cell = [tested_cell[i]+d[i] for i in [0,1]]
if on_board(tested_cell):
if field[tested_cell[1]][tested_cell[0]] == 3-player:
run_length += 1
elif field[tested_cell[1]][tested_cell[0]] == player:
if run_length > 0:
valid = True
break
else:
break
else:
break
else: break
if valid:
legals.append([move[0], move[1]])
return legals
def find_legal_moves(field, player):
neighbours = find_neighbours(field, player)
legals = validate_neighbours(neighbours, field, player)
return legals
def on_board(cell):
valid = True
for coord in cell:
if not(0<=coord<8):
valid = False
return valid