-
Notifications
You must be signed in to change notification settings - Fork 0
/
back.py
352 lines (290 loc) · 9.72 KB
/
back.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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
"""
Author : tharindra galahena (inf0_warri0r)
Project: em_gammon - a backgammon a.i.
Blog : http://www.inf0warri0r.blogspot.com
Date : 22/03/2013
License:
Copyright 2013 Tharindra Galahena
em_gammon is free software: you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software
Foundation, either version 3 of the License, or (at your option) any later
version. em_gammon is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
details.
* You should have received a copy of the GNU General Public License along with
em_gammon. If not, see http://www.gnu.org/licenses/.
"""
import copy
import random
import state
import threading
class back:
def __init__(self):
self.s = state.state()
self.mlst = list()
self.count = 0
self.lock = threading.Lock()
def mv_r(self, st, number):
ls = list()
for i in range(0, 24):
tmp = copy.deepcopy(st)
sc = tmp.xxx_r(i, number)
if sc != 0:
ls.append(tmp)
return ls
def mv_w(self, st, number):
ls = list()
for i in range(0, 24):
tmp = copy.deepcopy(st)
sc = tmp.xxx_w(i, number)
if sc != 0:
ls.append(tmp)
return ls
def move_1_r(self, st, number):
ls = list()
tmp = copy.deepcopy(st)
sc = tmp.unbar_r(number)
if sc == 0:
if tmp.bar_r > 0:
return ls
else:
for i in range(0, 24):
tmp = copy.deepcopy(st)
sc = tmp.xxx_r(i, number)
if sc != 0:
ls.append(tmp)
return ls
else:
ls.append(tmp)
return ls
def move_1_w(self, st, number):
ls = list()
tmp = copy.deepcopy(st)
sc = tmp.unbar_w(number)
if sc == 0:
if tmp.bar_w > 0:
return ls
else:
for i in range(0, 24):
tmp = copy.deepcopy(st)
sc = tmp.xxx_w(i, number)
if sc != 0:
ls.append(tmp)
return ls
else:
ls.append(tmp)
return ls
def move_2_r(self, st, number):
ls = list()
for i in range(18, 24):
tmp = copy.deepcopy(st)
pos_old = i
if tmp.possitions[pos_old][0] != 'r':
continue
if tmp.possitions[pos_old][1] <= 0:
continue
pos_new = i + number
if pos_new > 23:
p, n = tmp.possitions[pos_old]
if n <= 1:
tmp.possitions[pos_old] = 'n', 0
else:
tmp.possitions[pos_old] = p, n - 1
tmp.over_r = tmp.over_r + 1
else:
tmp.normal_move('r', pos_old, pos_new)
ls.append(tmp)
return ls
def move_2_w(self, st, number):
ls = list()
for i in range(0, 6):
tmp = copy.deepcopy(st)
pos_old = i
if tmp.possitions[pos_old][0] != 'w':
continue
if tmp.possitions[pos_old][1] <= 0:
continue
pos_new = i - number
if pos_new < 0:
p, n = tmp.possitions[pos_old]
if n <= 1:
tmp.possitions[pos_old] = 'n', 0
else:
tmp.possitions[pos_old] = p, n - 1
tmp.over_w = tmp.over_w + 1
else:
tmp.normal_move('w', pos_old, pos_new)
ls.append(tmp)
return ls
def move(self, st, player, number):
if player == 'r':
n = st.check_home_r()
if n + st.over_r == 15:
return self.move_2_w(st, number)
else:
return self.move_1_w(st, number)
else:
n = st.check_home_w()
if n + st.over_w == 15:
return self.move_2_r(st, number)
else:
return self.move_1_w_r(st, number)
def double_move(self, st, player, number1, number2):
ls = self.move(st, player, number1)
if len(ls) == 0:
return ls
lst = list()
for l in ls:
lst = lst + self.move(l, player, number2)
lst2 = list()
if player == 'r':
if self.s.bar_r == 0:
lst2 = self.move(st, player, number1 + number2)
else:
if self.s.bar_w == 0:
lst2 = self.move(st, player, number1 + number2)
return lst + lst2
def qd_move(self, st, player, number1, number2):
br = 0
moves = 0
ls = list()
if player == 'w':
br = self.s.bar_w
if br > 0:
ls = self.move(st, player, number1)
if len(ls) == 0:
return ls
moves = moves + 1
if ls[0].bar_w > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
if ls[0].bar_w > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
if ls[0].bar_w > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
else:
br = self.s.bar_r
if br > 0:
ls = self.move(st, player, number1)
if len(ls) == 0:
return ls
moves = moves + 1
if ls[0].bar_r > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
if ls[0].bar_r > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
if ls[0].bar_r > 0:
ls = self.move(ls[0], player, number1)
moves = moves + 1
if moves == 4:
return ls
if len(ls) == 0:
ls.append(st)
ls = self.move(ls[0], player, number1)
if len(ls) == 0:
return ls
if moves == 3:
return ls
lst = list()
for l in ls:
lst = lst + self.move(l, player, number1)
lst = lst + self.move(ls[0], player, number1 * 2)
if moves == 2:
return lst
lst2 = list()
for l in lst:
lst2 = lst2 + self.move(l, player, number1)
lst2 = lst2 + self.move(ls[0], player, number1 * 3)
if moves == 1:
return lst2
lst3 = list()
for l in lst2:
lst3 = lst3 + self.move(l, player, number1)
lst3 = lst3 + self.move(ls[0], player, number1 * 4)
lt = self.move(ls[0], player, number1 * 2)
for l in lt:
lst3 = lst3 + self.move(l, player, number1 * 2)
return lst3
def roll_dies(self):
n1 = random.randrange(1, 7)
n2 = random.randrange(1, 7)
return n1, n2
def expected(self, lst):
v = 0.0
for l in lst:
v = v + float(l) / 36.0
return v
def maximum(self, st):
lst = list()
for i in range(1, 7):
for j in range(i, 7):
ls = list()
if i == j:
ls = self.qd_move(st, 'r', i, j)
else:
ls = self.double_move(st, 'r', i, j)
if len(ls) <= 0:
lst.append(0)
continue
ls = list(set(ls))
sc = list()
for l in ls:
sc.append(l[1].count_score('w') + l[1].count_score('r'))
sc = sorted(sc)
lst.append(sc[len(sc) - 1])
return self.expected(lst)
def minimum(self, st):
lst = list()
for i in range(1, 7):
for j in range(i, 7):
ls = list()
if i == j:
ls = self.qd_move(st, 'w', i, j)
else:
ls = self.double_move(st, 'w', i, j)
if len(ls) <= 0:
lst.append(0)
continue
ls = set(ls)
sc = list()
for l in ls:
ns = l.count_score_w() + l.count_score_r()
sc.append(ns)
sc = sorted(sc)
lst.append(sc[0])
self.lock.acquire()
self.mlst.append((self.expected(lst), st))
self.count = self.count + 1
print self.count
self.lock.release()
def next_step(self):
n1, n2 = self.roll_dies()
print "numbers are ", n1, " & ", n2, "\n"
ls = list()
if n1 == n2:
ls = self.qd_move(self.s, 'r', n1, n2)
else:
ls = self.double_move(self.s, 'r', n1, n2)
print "len : ", len(ls)
ls = list(set(ls))
print "len : ", len(ls)
self.mlst = list()
self.count = 0
print "wait !!, em_gammon is thinking..."
th = list()
for i in range(0, len(ls)):
th = threading.Thread(target=self.minimum, args=(ls[i], ))
th.start()
print i
for t in threading.enumerate():
if t is not threading.currentThread():
t.join()
print ""
self.mlst = sorted(self.mlst)
if len(self.mlst) > 0:
self.s = self.mlst[len(self.mlst) - 1][1]