-
Notifications
You must be signed in to change notification settings - Fork 0
/
entities.py
297 lines (245 loc) · 9.63 KB
/
entities.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
"""
Entities, objects and classes, data structures, helper functions are here.
We assume each position as a Tuple (x,y), which x and y are integers.
We assume each action as a Tuple (start, end), which starts and ends are positions.
Written by Ali Zandian (alizandian@outlook.com) for University project, researching a better way to gauge unlimited trees.
A project at the university of Ashrafi Esfahani.
"""
from enum import IntEnum
import queue
SM = 14 # Separation Multiplier for
SCountM = 10 # Sheeps Count Multiplier
ADM = 20 # Average Distance Multiplier
AMM = 10 # Available Moves Multiplier
ACM = -10 # Available Captures Multiplier
MaxCountGame = 20
TurnTime = 60
class RoomType (IntEnum):
Disable = 0
Empty = 1
Sheep = 2
Fox = 3
class Turn (IntEnum):
Sheeps = 0
Fox = 1
class ControllerType(IntEnum):
Bot = 0,
Player = 1
class Strategy(IntEnum):
Minimax = 0
MinimaxPAB = 1
Expectimax = 2
Deepimax = 3
# Class of the board, containing the first initialization of board.
# And necessary functions to do on the board
class Board:
# Initialize properties
def __init__(self):
self.fox = (3,4)
self.sheeps = [(5,1),(5,2),(5,3),(5,4),(5,5),(5,6),(5,7),(6,3),(6,4),(6,5),(7,3),(7,4),(7,5)]
self.sheepsMax = 13
self.rooms = [[0,0,0,0,0,0,0,0,0],
[0,0,0,1,1,1,0,0,0],
[0,0,0,1,1,1,0,0,0],
[0,1,1,1,3,1,1,1,0],
[0,1,1,1,1,1,1,1,0],
[0,2,2,2,2,2,2,2,0],
[0,0,0,2,2,2,0,0,0],
[0,0,0,2,2,2,0,0,0],
[0,0,0,0,0,0,0,0,0]]
def Copy(self, board):
self.fox = board.fox
self.sheeps.clear()
for x in board.sheeps:
self.sheeps.append(x)
for r in range(len(board.rooms)):
for c in range(len(board.rooms[r])):
self.rooms[r][c] = board.rooms[r][c]
self.sheepsMax = board.sheepsMax
# Updates the Fox and Sheeps property
def HeavyUpdate(self):
self.sheeps = []
for row in range(len(self.rooms) -2):
for column in range(len(self.rooms[row +1]) -2):
if(rooms[row +1][column +1] == 3):
self.fox = (row +1, column +1)
if(rooms[row +1][column +1] == 2):
self.sheeps.append((row +1,column +1))
# Get only diagonally neighbors of a room
def __GetDiagonolyRooms(self, row, column):
return [(row -1, column -1), (row -1, column +1),
(row +1, column -1), (row +1, column +1)]
# Get only straight neighbors of a room
def __GetStraightRooms(self, row, column):
return [(row -1, column),
(row, column -1), (row, column +1),
(row +1, column)]
# Gets the neighbors of a room
def Neighbors(self, row, column):
neighbors = []
output = []
if((row == 0) or (row == 8) or (column == 0) or (column == 8)):
neighbors = []
elif(abs((row - column)) % 2 == 0):
neighbors = self.__GetDiagonolyRooms(row,column) + self.__GetStraightRooms(row,column)
else:
neighbors = self.__GetStraightRooms(row,column)
for room in neighbors:
if(self.rooms[room[0]][room[1]] != RoomType.Disable.value):
output.append(room)
return output
def Action(self, start, end):
if(self.rooms[end[0]][end[1]] != RoomType.Empty.value):
return
if(self.rooms[start[0]][start[1]] == RoomType.Sheep.value):
self.sheeps.remove(start)
self.sheeps.append(end)
if(self.rooms[start[0]][start[1]] == RoomType.Fox.value):
self.fox = end
if(abs(end[0] - start[0]) == 2 or abs(end[1] - start[1]) == 2):
possibleSheep = (int((end[0] + start[0])/2) , int((end[1] + start[1])/2))
if(self.rooms[possibleSheep[0]][possibleSheep[1]] == RoomType.Sheep.value):
# Its a capture
self.rooms[possibleSheep[0]][possibleSheep[1]] = RoomType.Empty.value
self.sheeps.remove(possibleSheep)
# Updating the board
self.rooms[end[0]][end[1]] = self.rooms[start[0]][start[1]]
self.rooms[start[0]][start[1]] = RoomType.Empty.value
def ReverseAction(self, start, end):
if(self.rooms[start[0]][start[1]] != RoomType.Empty.value):
return
if(self.rooms[end[0]][end[1]] == RoomType.Sheep.value):
self.sheeps.remove(end)
self.sheeps.append(start)
if(self.rooms[end[0]][end[1]] == RoomType.Fox.value):
self.fox = start
if(abs(end[0] - start[0]) == 2 or abs(end[1] - start[1]) == 2):
# It was a capture, Redo the capture by bringing a sheep inside
previousSheep = ((end[0] + start[0])/2, (end[1] + start[1])/2)
self.rooms[previousSheep[0]][previousSheep[1]] = RoomType.Sheep.value
self.sheeps.append(previousSheep)
# Updating the board
self.rooms[start[0]][start[1]] = self.rooms[end[0]][end[1]]
self.rooms[end[0]][end[1]] = RoomType.Empty.value
def AvailableActionsFox(self):
actions = []
neighbors = self.Neighbors(self.fox[0], self.fox[1])
for n in neighbors:
if(self.rooms[n[0]][n[1]] == RoomType.Empty.value):
actions.append((self.fox, n))
elif (self.IsCapturable(n)):
actions.append((self.fox, self.__GetCapturableRoom(n)))
return actions
def AvailableActionsSheep(self):
actions = []
for sheep in self.sheeps:
neighbors = self.Neighbors(sheep[0], sheep[1])
for n in neighbors:
if(self.rooms[n[0]][n[1]] == RoomType.Empty.value):
actions.append((sheep, n))
return actions
def __GetCapturableRoom(self, room):
if(self.IsCapturable(room)):
return (room[0] + (room[0] - self.fox[0]), room[1] + (room[1] - self.fox[1]))
def AvailableMoveCount(self):
count = 0
neighbors = self.Neighbors(self.fox[0], self.fox[1])
for n in neighbors:
if(self.rooms[n[0]][n[1]] == RoomType.Empty.value):
count += 1
return count
def AvailableCaptureCount(self):
count = 0
neighbors = self.Neighbors(self.fox[0], self.fox[1])
for n in neighbors:
if(self.IsCapturable(n)):
count += 1
return count
def IsCapturable(self, room):
if(self.rooms[room[0]][room[1]] == RoomType.Sheep.value):
if(self.rooms[room[0] + (room[0] - self.fox[0])][room[1] + (room[1] - self.fox[1])] == RoomType.Empty.value):
return True
def AverageFoxSheepDistance(self):
count = 0
totalDistance = 0
for s in self.sheeps:
count += 1
totalDistance += abs(s[0] - self.fox[0]) + abs(s[1] - self.fox[1])
return int(totalDistance / count)
def SheepsSeperation(self):
totalAdjacentEmptyRooms = 0
for sheep in self.sheeps:
neighbors = self.Neighbors(sheep[0], sheep[1])
for n in neighbors:
if(self.rooms[n[0]][n[1]] == RoomType.Empty.value):
totalAdjacentEmptyRooms += 1
return int(totalAdjacentEmptyRooms / len(self.sheeps))
def EvaluationFunction(self):
global SCountM
global AMM
global ACM
global ADM
global SM
if(len(self.sheeps) == 0):
return 0
return int((self.sheepsMax / len(self.sheeps))) * SCountM + self.AvailableMoveCount() * AMM + self.AvailableCaptureCount() * ACM + self.SheepsSeperation() * SM + self.AverageFoxSheepDistance() * ADM
class TreeNode:
def __init__(self, depth):
self.depth = depth
self.parent = None
self.children = []
def AddChildren(self, *args):
for x in args:
self.children.append(x)
def GetParent(self):
return self.parent
def GetChildren(self):
return self.children
def GetLeaves(self):
if(len(self.children) != 0):
leaves = []
for x in self.children:
leaves += x.GetLeaves()
return leaves
return [self]
def GetTop(self):
if(self.parent != None):
return self.parent.GetTop()
return self
def GetDepthNodes(self, depth):
if(depth == 0):
return [self]
elif(len(self.GetChildren()) == 0):
return []
else:
nodes = []
for x in self.GetChildren():
nodes += x.GetDepthNodes(depth -1)
return nodes
def GetNeighburs(self):
if(self.parent == None):
return self
return self.parent.GetChildren()
def SameDepthNodes(self):
if(self.parent != None):
return self.GetTop().GetDepthNodes(self.depth)
return self
def GetBottom(self):
leaves = self.GetLeaves()
return max(leaves, key = lambda x: x.depth)
class MinimaxTreeNode(TreeNode):
def __init__(self, depth):
super().__init__(depth)
self.actions = queue.Queue().queue
self.point = None
class DeepimaxTreeNode(MinimaxTreeNode):
def __init__(self, depth):
super().__init__(depth)
self.nominies = []
class Controller():
def __init__(self):
self.title = None
def Action(self, board, turn):
self.turn = turn
self.board = board
pass