This repository has been archived by the owner on Mar 19, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcode.py
256 lines (227 loc) · 7.17 KB
/
code.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
from numpy import genfromtxt
from time import time
n_queens = 8
def num_of_column_and_row_threats(my_data):
column_threats = 0
row_threats = 0
for i in range(n_queens):
num_of_queens_column = 0
num_of_queens_row = 0
for j in range(n_queens):
if (my_data[j][0] == i + 1):
num_of_queens_row += 1
if (my_data[j][1] == i + 1):
num_of_queens_column += 1
if (num_of_queens_row > 1):
row_threats += num_of_queens_row - 1
if (num_of_queens_column > 1):
column_threats += num_of_queens_column - 1
return column_threats + row_threats
# we could count number of rows or columns without queens and the answer would have been the same
def num_of_diameter_threats(my_data):
threats = 0
blacklist = []
for i in range(n_queens):
for j in range(i + 1, n_queens):
if (j in blacklist):
continue
if (abs(my_data[i][0] - my_data[j][0]) == abs(my_data[i][1] - my_data[j][1])):
threats += 1
blacklist.append(j)
# if the abs wasn't there, we could get num of main diameter threats
# if the abs wasn't there and a minus was behind the right part of equation, we could get num of non_main diameter threats
return threats
def num_of_threats(my_data):
return num_of_diameter_threats(my_data) + num_of_column_and_row_threats(my_data)
def danger(my_data):
dangers = 0
for i in range(n_queens):
for j in range(i + 1, n_queens):
if(my_data[i][0] == my_data[j][0] or my_data[i][1] == my_data[j][1] or abs(my_data[i][0] - my_data[j][0]) == abs(my_data[i][1] - my_data[j][1])):
dangers += 1
return int(dangers)
# moves:
# 0 1 2
# 7 3
# 6 5 4
num_of_moves = 8
def is_duplicate_element(my_data, element):
num_of_existed = 0
for i in my_data:
if (i == element):
if (num_of_existed > 0):
return True
num_of_existed += 1
return False
def move_if_possible(my_data, queen_no, move_no):
temp = [my_data[queen_no][0], my_data[queen_no][1]]
if (move_no == 1):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1]]
if (my_data[queen_no][0] < 1 or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 3):
my_data[queen_no] = [my_data[queen_no][0], my_data[queen_no][1] + 1]
if (my_data[queen_no][1] > num_of_moves or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 5):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1]]
if (my_data[queen_no][0] > num_of_moves or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 7):
my_data[queen_no] = [my_data[queen_no][0], my_data[queen_no][1] - 1]
if (my_data[queen_no][1] < 1 or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 0):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1] - 1]
if (my_data[queen_no][0] < 1 or my_data[queen_no][1] < 1 or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 2):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1] + 1]
if (my_data[queen_no][0] < 1 or my_data[queen_no][1] > num_of_moves or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 4):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1] + 1]
if (my_data[queen_no][0] > num_of_moves or my_data[queen_no][1] > num_of_moves or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
elif (move_no == 6):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1] - 1]
if (my_data[queen_no][0] > num_of_moves or my_data[queen_no][1] < 1 or is_duplicate_element(my_data, my_data[queen_no])):
my_data[queen_no] = temp
return False
return True
def move(my_data, queen_no, move_no):
if (move_no == 1):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1]]
elif (move_no == 3):
my_data[queen_no] = [my_data[queen_no][0], my_data[queen_no][1] + 1]
elif (move_no == 5):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1]]
elif (move_no == 7):
my_data[queen_no] = [my_data[queen_no][0], my_data[queen_no][1] - 1]
elif (move_no == 0):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1] - 1]
elif (move_no == 2):
my_data[queen_no] = [my_data[queen_no][0] - 1, my_data[queen_no][1] + 1]
elif (move_no == 4):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1] + 1]
elif (move_no == 6):
my_data[queen_no] = [my_data[queen_no][0] + 1, my_data[queen_no][1] - 1]
def print_grid(my_data):
for i in range(n_queens):
for j in range(n_queens):
flag = False
for k in range(n_queens):
if (my_data[k][0] == i + 1 and my_data[k][1] == j + 1):
print('X', end = ' ')
flag = True
break
if (flag == False):
print('O', end = ' ')
print()
def copy_board(my_data):
temp = []
for i in range(n_queens):
temp.append([int(my_data[i][0]), int(my_data[i][1])])
return temp
def generate_next_children(my_data):
children = []
for i in range(n_queens):
for j in range(num_of_moves):
if(move_if_possible(my_data, i, j)):
children.append(copy_board(my_data))
move(my_data, i, (j + 4) % 8)
return children
all_moves = 0
def IDS(root_grid):
i = 1
global all_moves
all_moves = 0
while (True):
result = DFS(root_grid, i)
if (result != None):
return result, i, all_moves
i += 1
def DFS(root_grid, limit):
if limit == 0:
if num_of_threats(root_grid) == 0:
return root_grid
else:
return None
for i in range(n_queens):
for j in range(num_of_moves):
if(move_if_possible(root_grid, i, j)):
global all_moves
all_moves += 1
temp = DFS(root_grid,limit - 1)
if temp is not None:
return temp
move(root_grid, i, (j + 4) % 8)
return None
def A_star(root_grid):
nodes = [root_grid]
levels = [0]
measures = [0 + num_of_threats(root_grid)]
moves = 0
while(True):
moves += 1
min_index = measures.index(min(measures))
node = nodes.pop(min_index)
level = levels.pop(min_index)
measure = measures.pop(min_index)
if (num_of_threats(node) == 0):
return node, level, moves
temp = generate_next_children(node)
for i in range(len((temp))):
nodes.append(temp[i])
levels.append(level + 1)
measures.append(level + 1 + num_of_threats(temp[i]))
def BFS(root_grid):
nodes = [root_grid]
v = {}
levels = [0]
moves = 0
while(True):
moves += 1
node = nodes.pop(0)
level = levels.pop(0)
if (str(node) not in v):
if (num_of_threats(node) == 0):
return node, level, moves
else:
v[str(node)] = 0
temp = generate_next_children(node)
for i in range(len(temp)):
if (str(temp[i]) not in v):
nodes.append(temp[len(temp) - i - 1])
levels.append(level + 1)
input_file_name = 'test_a.csv'
temp_data = genfromtxt(input_file_name, delimiter=',')
data = copy_board(temp_data)
print(input_file_name)
t1 = time()
a, b, c = (IDS(data))
# c = all_moves
t2 = time()
print('result')
if (a != None):
print_grid(a)
else:
print(None)
print('level = ' ,b)
print('all moves =', c)
print('time = ', t2 - t1)
print()