forked from splendor-kill/ml-five
-
Notifications
You must be signed in to change notification settings - Fork 0
/
board.py
273 lines (224 loc) · 8.13 KB
/
board.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
268
269
270
271
272
from matplotlib import ticker
import matplotlib.pyplot as plt
import numpy as np
class Board(object):
'''
describe the board state
Attributes:
------------------
N : int
the size of board edge
stones : 2d array
board state
'''
STONE_EMPTY = 0
STONE_BLACK = 1
STONE_WHITE = 2
BOARD_SIZE = 9
BOARD_SIZE_SQ = BOARD_SIZE ** 2
WIN_STONE_NUM = 5
WIN_PATTERN = {STONE_BLACK: np.ones(WIN_STONE_NUM, dtype=int) * STONE_BLACK,
STONE_WHITE: np.ones(WIN_STONE_NUM, dtype=int) * STONE_WHITE}
def __init__(self, board_size=9):
Board.BOARD_SIZE = board_size
Board.BOARD_SIZE_SQ = Board.BOARD_SIZE ** 2
self.stones = np.zeros(Board.BOARD_SIZE_SQ, np.int)
# self.stones = np.random.rand(N, N)
self.over = False
self.winner = Board.STONE_EMPTY
self.exploration = False
@staticmethod
def rand_generate_a_position():
while True:
b = Board()
m = b.stones
most = 2 # m.size // 2
white = np.random.randint(1, most)
m[0:white] = Board.STONE_WHITE
m[white:white * 2] = Board.STONE_BLACK
m[white * 2] = np.random.randint(1)
np.random.shuffle(m)
m2 = m.reshape(-1, Board.BOARD_SIZE)
if not Board.find_conn_5_all(m2):
return b
def show(self):
fig = plt.figure()
ax = fig.add_subplot(111)
ax.matshow(self.stones)
labels = [i + 1 for i in range(Board.BOARD_SIZE)]
# method 1
# ax.xaxis.set_ticks(range(self.N))
# ax.set_xticklabels(labels)
# method 2
ax.set_xticklabels([''] + labels)
ax.xaxis.set_major_locator(ticker.MultipleLocator(1))
ax.set_yticklabels([''] + labels)
ax.yaxis.set_major_locator(ticker.MultipleLocator(1))
plt.draw()
def move(self, x, y, v):
if v != Board.STONE_BLACK and v != Board.STONE_WHITE:
raise Exception('illegal arg v[%d]' % (v))
index = np.ravel_multi_index((x, y), (Board.BOARD_SIZE, Board.BOARD_SIZE))
if index >= Board.BOARD_SIZE_SQ or self.stones[index] != Board.STONE_EMPTY:
raise Exception('cannot move here')
self.stones[index] = v
def get(self, x, y):
return self.stones[x * Board.BOARD_SIZE + y]
def is_empty(self):
np.all(self.stones == 0)
def query_stand_for(self, who_first):
stat = np.bincount(self.stones, minlength=3)
op = Board.oppo(who_first)
if stat[who_first] == stat[op]:
return who_first
if stat[who_first] > stat[op]:
return op
def is_legal(self, x, y):
"""
:type pos tuple(x, y)
"""
return self.stones[x * Board.BOARD_SIZE + y] == Board.STONE_EMPTY
@staticmethod
def oppo(who):
if who == Board.STONE_BLACK:
return Board.STONE_WHITE
if who == Board.STONE_WHITE:
return Board.STONE_BLACK
raise Exception('illegal arg who[%d]' % (who))
@staticmethod
def change(old, new):
d = np.nonzero(new.stones - old.stones)
if d[0].size == 0:
return None
return d[0][0]
@staticmethod
def _row(arr2d, row, col):
return arr2d[row, :]
@staticmethod
def _col(arr2d, row, col):
return arr2d[:, col]
@staticmethod
def _diag(arr2d, row, col):
return np.diag(arr2d, col - row)
@staticmethod
def _diag_counter(arr2d, row, col):
return Board._diag(np.rot90(arr2d), arr2d.shape[1] - 1 - col, row)
@staticmethod
def _find_subseq(seq, sub):
'''
Returns:
---------------
indexes: array
all occurs of sub in seq
'''
# print('sub seq find:')
# print(seq)
# print(sub)
assert seq.size >= sub.size
target = np.dot(sub, sub)
candidates = np.where(np.correlate(seq, sub) == target)[0]
# some of the candidates entries may be false positives, double check
check = candidates[:, np.newaxis] + np.arange(len(sub))
mask = np.all((np.take(seq, check) == sub), axis=-1)
return candidates[mask]
def find_conn_5(self, board, center_row, center_col, who):
lines = []
lines.append(Board._row(board, center_row, center_col))
lines.append(Board._col(board, center_row, center_col))
lines.append(Board._diag(board, center_row, center_col))
lines.append(Board._diag_counter(board, center_row, center_col))
for v in lines:
if v.size < Board.WIN_STONE_NUM:
continue
occur = Board._find_subseq(v, Board.WIN_PATTERN[who])
if occur.size != 0:
return True
return False
@staticmethod
def find_pattern_will_win(board, who):
pats = np.identity(Board.WIN_STONE_NUM, int)
pats = 1 - pats
pats[pats == 1] = who
board = board.stones.reshape(-1, Board.BOARD_SIZE)
lines = []
for i in range(Board.BOARD_SIZE):
lines.append(Board._row(board, i, 0))
lines.append(Board._col(board, 0, i))
lines.append(Board._diag(board, i, 0))
lines.append(Board._diag(board, 0, i))
lines.append(Board._diag_counter(board, i, Board.BOARD_SIZE - 1))
lines.append(Board._diag_counter(board, 0, i))
for v in lines:
if v.size < Board.WIN_STONE_NUM:
continue
for p in pats:
occur = Board._find_subseq(v, p)
if occur.size != 0:
return True
return False
@staticmethod
def find_conn_5_all(board):
lines = []
for i in range(Board.BOARD_SIZE):
lines.append(Board._row(board, i, 0))
lines.append(Board._col(board, 0, i))
lines.append(Board._diag(board, i, 0))
lines.append(Board._diag(board, 0, i))
lines.append(Board._diag_counter(board, i, Board.BOARD_SIZE - 1))
lines.append(Board._diag_counter(board, 0, i))
for v in lines:
if v.size < Board.WIN_STONE_NUM:
continue
occur = Board._find_subseq(v, Board.WIN_PATTERN[Board.STONE_BLACK])
if occur.size != 0:
return True
occur = Board._find_subseq(v, Board.WIN_PATTERN[Board.STONE_WHITE])
if occur.size != 0:
return True
return False
def is_over(self, old_board):
'''
Returns:
----------------
over: bool
True if the game is over
winner: int
the winner if the game is over, 0 if end with draw,
None if the game is not over
loc: int
where is the piece placed
'''
# print('old:')
# if old_board is None:
# print(old_board)
# else:
# print(old_board.stones.reshape(-1, Board.BOARD_SIZE))
# print('new:')
# print(self.stones.reshape(-1, Board.BOARD_SIZE))
if old_board is None: # at the beginning
return False, None, None
diff = np.where((old_board.stones != self.stones))[0]
if diff.size == 0:
raise Exception('same state')
if diff.size > 1:
raise Exception('too many steps')
loc = diff[0]
if old_board.stones[loc] != 0:
raise Exception('must be set at empty place')
who = self.stones[loc]
grid = self.stones.reshape(-1, Board.BOARD_SIZE)
row, col = divmod(loc, Board.BOARD_SIZE)
# print('who[%d] at [%d, %d]' % (who, row, col))
# print(grid)
win = self.find_conn_5(grid, row, col, who)
if win:
self.over = True
self.winner = who
return True, who, loc
if np.where(self.stones == 0)[0].size == 0: # the last step
self.over = True
return True, Board.STONE_EMPTY, loc
return False, None, loc
def __str__(self):
# grid = self.stones.reshape(-1, Board.BOARD_SIZE)
return str(self.stones)