-
Notifications
You must be signed in to change notification settings - Fork 0
/
player.py
281 lines (244 loc) · 11.1 KB
/
player.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
from base import is_white, is_black, Color, in_bounds, Move, get_captured_pos, make_piece
def find_piece(board, piece):
locs = []
for x in range(8):
for y in range(8):
char = board[x][y]
if char == piece:
locs.append((x,y))
return locs
class Player:
def __init__(self, color, board, run_constructor=True):
self.color = color
self.forwards_movement = 1 if self.color == Color.WHITE else -1
self.startrank = 0 if self.color == Color.WHITE else 7
self.endrank = 7 if self.color == Color.WHITE else 0
if run_constructor:
self.king_has_moved = False
self.lrook_has_moved = False
self.rrook_has_moved = False
self.pieces = self.get_all_pieces(board)
self.king_pos = find_piece(board, make_piece(self.color, 'k'))[0]
def make_copy(self, board) -> "Player":
new_player = Player(self.color, board, run_constructor=False)
new_player.king_has_moved = self.king_has_moved
new_player.lrook_has_moved = self.lrook_has_moved
new_player.rrook_has_moved = self.rrook_has_moved
new_player.pieces = self.pieces.copy()
new_player.king_pos = self.king_pos
return new_player
def get_all_pieces(self, board):
pieces = set()
color_check = is_white if self.color == Color.WHITE else is_black
for x in range(8):
for y in range(8):
char = board[x][y]
if color_check(char):
pieces.add((x,y))
return pieces
def remove_piece(self, loc):
self.pieces.remove(loc)
def add_piece(self, loc):
self.pieces.add(loc)
def move_piece(self, before, after):
self.pieces.remove(before)
self.pieces.add(after)
def get_vision_loop(self, board, x, y, dx, dy, vision):
for d in range(1, 9):
if not in_bounds(x + d*dx, y + d*dy):
break
vision.add((x + d*dx, y + d*dy))
if board[x + d*dx][y + d*dy] != 'e':
# We can see this piece, but we can't see past this piece.
vision.add((x + d*dx, y + d*dy))
break
def king_vision(self, x, y):
vision = set()
if in_bounds(x - 1, y - 1):
vision.add((x - 1, y - 1))
if in_bounds(x - 1, y):
vision.add((x - 1, y))
if in_bounds(x - 1, y + 1):
vision.add((x - 1, y + 1))
if in_bounds(x, y - 1):
vision.add((x, y - 1))
if in_bounds(x, y + 1):
vision.add((x, y + 1))
if in_bounds(x + 1, y - 1):
vision.add((x + 1, y - 1))
if in_bounds(x + 1, y):
vision.add((x + 1, y))
if in_bounds(x + 1, y + 1):
vision.add((x + 1, y + 1))
return vision
def bishop_vision(self, board, x, y, vision): # Vision is given a list of coordinates: [(x,y), (x2, y2)]
self.get_vision_loop(board, x, y, 1, 1, vision)
self.get_vision_loop(board, x, y, -1, -1, vision)
self.get_vision_loop(board, x, y, -1, 1, vision)
self.get_vision_loop(board, x, y, 1, -1, vision)
def rook_vision(self, board, x, y, vision): # Vision is given a list of coordinates: [(x,y), (x2, y2)]
self.get_vision_loop(board, x, y, 1, 0, vision)
self.get_vision_loop(board, x, y, -1, 0, vision)
self.get_vision_loop(board, x, y, 0, 1, vision)
self.get_vision_loop(board, x, y, 0, -1, vision)
def knight_vision(self, x, y):
vision = set()
if in_bounds(x - 2, y - 1):
vision.add((x - 2, y - 1))
if in_bounds(x - 2, y + 1):
vision.add((x - 2, y + 1))
if in_bounds(x + 2, y - 1):
vision.add((x + 2, y - 1))
if in_bounds(x + 2, y + 1):
vision.add((x + 2, y + 1))
if in_bounds(x - 1, y - 2):
vision.add((x - 1, y - 2))
if in_bounds(x - 1, y + 2):
vision.add((x - 1, y + 2))
if in_bounds(x + 1, y - 2):
vision.add((x + 1, y - 2))
if in_bounds(x + 1, y + 2):
vision.add((x + 1, y + 2))
return vision
# Dictionary mapping pieces to Vision.
# For pawns, kings, and knights, Vision is just a list of positions that are in the piece's line-of-sight.
# For rooks, bishops, and queens, Vision is a map: { direction: list of positions in the piece's line-of-sight }.
# - Here, direction refers to one of the 8 directions (-1, 0), (1, 1), ...
def recalc_vision(self, board):
vision = {}
for x, y in sorted(self.pieces):
p = board[x][y]
typ = p.lower()
if typ == 'p':
vision[(x,y)] = set()
if in_bounds(x + 1, y + self.forwards_movement):
vision[(x,y)].add((x + 1, y + self.forwards_movement))
if in_bounds(x - 1, y + self.forwards_movement):
vision[(x,y)].add((x - 1, y + self.forwards_movement))
elif typ == 'k':
vision[(x,y)] = self.king_vision(x, y)
elif typ == 'n':
vision[(x,y)] = self.knight_vision(x, y)
else:
vision[(x,y)] = set()
if typ == 'r' or typ == 'q':
self.rook_vision(board, x, y, vision[(x,y)])
if typ == 'b' or typ == 'q':
self.bishop_vision(board, x, y, vision[(x,y)])
return vision
def recompute_all_attacking_locs(self, vision):
all_attacking_locs = set()
for loc in vision:
all_attacking_locs |= vision[loc]
return all_attacking_locs
def check_can_castle_left(self, board):
backrank = self.startrank
secondrank = backrank + self.forwards_movement
thirdrank = secondrank + self.forwards_movement
# Check if king or leftrook has moved.
if self.king_has_moved or self.lrook_has_moved:
return False
# Check if squares are occupied.
if board[1][backrank] != 'e' or board[2][backrank] != 'e' or board[3][backrank] != 'e':
return False
# Check if knight is attacking
knight_piece = make_piece(self.color, 'n')
if knight_piece in {board[0][secondrank],
board[1][secondrank],
board[2][secondrank],
board[3][secondrank],
board[4][secondrank],
board[5][secondrank],
board[6][secondrank],
board[0][thirdrank],
board[1][thirdrank],
board[2][thirdrank],
board[3][thirdrank],
board[4][thirdrank],
board[5][thirdrank]
}:
return True
# Check if pawn is attacking
pawn_piece = make_piece(self.color, 'p')
pawn_attacking_squares = {board[0][secondrank],
board[1][secondrank],
board[2][secondrank],
board[3][secondrank],
board[4][secondrank],
board[5][secondrank],
}
if pawn_piece in pawn_attacking_squares:
return True
# Check if king is attacking. Same squares as where pawn could be.
king_piece = make_piece(self.color, 'k')
if king_piece in pawn_attacking_squares:
return True
# Check if rook / bishop / queen are attacking
rook_piece = make_piece(self.color, 'r')
bishop_piece = make_piece(self.color, 'b')
queen_piece = make_piece(self.color, 'q')
for loc in [(1, backrank), (2, backrank), (3, backrank), (4, backrank)]:
for dx, dy in [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]:
attacking_pieces = rook_piece + queen_piece if dx == 0 or dy == 0 else bishop_piece + queen_piece
for d in range(1, 9):
if not in_bounds(loc[0] + d*dx, loc[1] + d*dy):
break
board_piece = board[loc[0] + d*dx][loc[1] + d*dy]
if board_piece != 'e':
if board_piece in attacking_pieces:
return True
break
def check_can_castle_right(self, board):
backrank = self.startrank
secondrank = backrank + self.forwards_movement
thirdrank = secondrank + self.forwards_movement
# Check if king or right rook has moved.
if self.king_has_moved or self.rrook_has_moved:
return False
# Check if squares are occupied.
if board[5][backrank] != 'e' or board[6][backrank] != 'e':
return False
# Check if knight is attacking
knight_piece = make_piece(self.color, 'n')
if knight_piece in {board[2][secondrank],
board[3][secondrank],
board[4][secondrank],
board[5][secondrank],
board[6][secondrank],
board[7][secondrank],
board[3][thirdrank],
board[4][thirdrank],
board[5][thirdrank],
board[6][thirdrank],
board[7][thirdrank],
}:
return True
# Check if pawn is attacking
pawn_piece = make_piece(self.color, 'p')
pawn_attacking_squares = {board[3][secondrank],
board[4][secondrank],
board[5][secondrank],
board[6][secondrank],
board[7][secondrank],
}
if pawn_piece in pawn_attacking_squares:
return True
# Check if king is attacking. Same squares as where pawn could be.
king_piece = make_piece(self.color, 'k')
if king_piece in pawn_attacking_squares:
return True
# Check if rook / bishop / queen are attacking
rook_piece = make_piece(self.color, 'r')
bishop_piece = make_piece(self.color, 'b')
queen_piece = make_piece(self.color, 'q')
for loc in [(4, backrank), (5, backrank), (6, backrank)]:
for dx, dy in [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]:
attacking_pieces = rook_piece + queen_piece if dx == 0 or dy == 0 else bishop_piece + queen_piece
for d in range(1, 9):
if not in_bounds(loc[0] + d*dx, loc[1] + d*dy):
break
board_piece = board[loc[0] + d*dx][loc[1] + d*dy]
if board_piece != 'e':
if board_piece in attacking_pieces:
return True
break