-
Notifications
You must be signed in to change notification settings - Fork 38
/
Copy pathsimple_solver.py
199 lines (164 loc) · 7.38 KB
/
simple_solver.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
import debug_utils as dbg
from copy import deepcopy
class SimpleSolver:
def __init__(self):
self.board_size = 9
self.match_list = [(0, 1, 13, 19), (2, 3, 14, 20), (4, 5, 15, 21), (6, 7, 18, 22), (8, 9, 16, 23), (10, 11, 17, 24)]
self.special_candies = [1, 3, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24]
self.simple_candies = [0, 2, 4, 6, 8, 10]
self.striped_candies_h = [1, 3, 5, 7, 9, 11]
self.striped_candies_v = range(13, 19)
self.striped_candies = self.striped_candies_h[:]
self.striped_candies.extend(self.striped_candies_v)
self.wrapped_candies = range(19, 25)
self.chocolate = [12]
self.game_board = None
self.potential_start_coords = set()
def get_score(self, candy_type):
if candy_type in self.simple_candies:
return 20
if candy_type in self.striped_candies:
return 120
if candy_type in self.wrapped_candies:
return 300
return 0
def compute_score(self, board, candies_coords):
score = 0
for coords in candies_coords:
candy_value = board[coords[0]][coords[1]]
score += self.get_score(candy_value)
if len(candies_coords) == 4:
score *= 3
if len(candies_coords) >= 5:
score *= 10
return score
def compute_explosions_chocolate(self, board, color):
to_explode = []
for i in range(self.board_size):
for j in range(self.board_size):
if self.candy_matches(board[i][j], color):
to_explode.append((i, j))
return to_explode
def get_striped_explosion(self, board, coords):
to_explode = []
candy_type = board[coords[0]][coords[1]]
if candy_type in self.striped_candies_h:
for k in range(self.board_size):
to_explode.append((coords[0], k))
if candy_type in self.striped_candies_v:
for k in range(self.board_size):
to_explode.append((k, coords[1]))
return to_explode
def candy_matches(self, type1, type2):
if type1 == type2:
return True
else:
for match in self.match_list:
if type1 in match and type2 in match:
return True
return False
def compute_explosions_lines(self, board, start):
directions = [[(-1, 0), (1, 0)], # vertical
[(0, -1), (0, 1)]] # horizontal
to_explode = []
for dirs in directions:
open_list = [start]
for d in dirs:
i = start[0] + d[0]
j = start[1] + d[1]
while 0 <= i < self.board_size and 0 <= j < self.board_size and board[i][j] != -1 \
and self.candy_matches(board[i][j], board[start[0]][start[1]]):
open_list.append((i, j))
i += d[0]
j += d[1]
if len(open_list) >= 3:
for element in open_list:
if element not in to_explode:
if board[element[0]][element[1]] in self.striped_candies:
to_explode.extend(self.get_striped_explosion(board, element))
else:
to_explode.append(element)
return to_explode
def compute_explosions(self, start, end, board):
chocolate_multiplier = 1
to_explode = []
if board[start[0]][start[1]] in self.special_candies and board[end[0]][end[1]] in self.special_candies:
score = 500000
to_explode = [start, end]
else:
if board[start[0]][start[1]] == 12: # chocolate
to_explode = self.compute_explosions_chocolate(board, board[end[0]][end[1]])
chocolate_multiplier = 100
else:
to_explode = self.compute_explosions_lines(board, start)
to_explode.sort(key=(lambda x: x[0]))
score = self.compute_score(board, to_explode) * chocolate_multiplier
if len(to_explode) == 4 and board[start[0]][start[1]] != 12: # striped candy
board[start[0]][start[1]] += 1
to_explode.remove(start)
#if len(to_explode) > 0:
# print '\n\nStarting board:'
# dbg.print_board(board)
# Slide the other candies down after explosions take place
for coord in to_explode:
i, j = coord
while i > 0:
if board[i-1][j] != -1 and (i-1, j) not in self.potential_start_coords:
self.potential_start_coords.add((i, j))
board[i][j], board[i-1][j] = board[i-1][j], board[i][j]
i -= 1
board[i][j] = -1
#if len(to_explode) > 0:
# print '\nResult from {0}, count={1}, score={2}:'.format(start, len(to_explode), score)
#dbg.print_board(board)
return score, board
def evaluate_board(self, start, end, board):
total_score, new_board = self.compute_explosions(start, end, board)
score = total_score
multiplier = 1
while score > 0:
use_new = False
if use_new:
potential_start = deepcopy(self.potential_start_coords)
self.potential_start_coords = set()
score = 0
for coord in potential_start:
score, new_board = self.compute_explosions((coord[0], coord[1]), end, new_board)
if score > 0:
total_score += score + multiplier * 60
multiplier += 2
else:
for i in range(0, self.board_size):
for j in range(0, self.board_size):
score, new_board = self.compute_explosions((i, j), end, new_board)
if score > 0:
total_score += score + multiplier * 60
multiplier += 2
return total_score, new_board
def check_direction(self, start, dir):
end = (start[0]+dir[0], start[1]+dir[1])
board = deepcopy(self.game_board)
if start[0] < 0 or start[0] > self.board_size or end[0] < 0 or end[0] > self.board_size\
or start[1] < 0 or start[1] > self.board_size or end[1] < 0 or end[1] > self.board_size:
return -1, [], None
# swap
board[start[0]][start[1]], board[end[0]][end[1]] = board[end[0]][end[1]], board[start[0]][start[1]]
score_start, start_board = self.evaluate_board(start, end, board)
score_end, end_board = self.evaluate_board(end, start, board)
if score_start > score_end:
return score_start, [start, end], start_board
else:
return score_end, [end, start], end_board
def solve_board(self, board):
self.game_board = board
max_score = 0
chosen_move = []
for i in range(0, 8):
for j in range(0, 8):
possible_directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for d in possible_directions:
score, move, b = self.check_direction((i, j), d)
if score >= max_score:
max_score = score
chosen_move = move
return max_score, chosen_move