-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.py
208 lines (174 loc) · 6.14 KB
/
utils.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
"""
This file contains helper functions used in the main file
"""
import os
import shutil
import random
curr_dir = os.path.realpath(os.path.join(os.getcwd(), os.path.dirname(__file__))) # Store current directory path
"""
Function which captures puzzles from a given input file and returns them as a list
"""
def getPuzzles(file_name):
with open(file_name) as f:
puzzles = []
for line in f:
line = line.split()
puzzle = [[],[]]
count = 0
if line:
for i in line:
num = int(i)
if count < 4:
puzzle[0].append(num)
else:
puzzle[1].append(num)
count += 1
puzzles.append(puzzle)
return puzzles
"""
Function which writes all the search/solution paths to appropriate files.
Also creates directories for them, to keep things neat and readable.
"""
def writeResults(sol_file_name, srch_file_name, search_results, timeout, algo):
moves, costs, sol_path, srch_path, total_cost, end_time, timedOut = search_results # unpacks results
solutions_dir = curr_dir + '/solution_files/'
search_dir = curr_dir + '/search_files/'
# Creates directories for output files to keep things neat
try:
os.mkdir(solutions_dir)
os.mkdir(search_dir)
except OSError:
pass # folder already exists, ignore warning
# Open files for writing
sol_f = open(solutions_dir + sol_file_name, 'w')
srch_f = open(search_dir + srch_file_name, 'w')
if(timedOut):
print('Search exceeded {} seconds! Execution halted.\n'.format(timeout))
sol_f.write('no solution')
srch_f.write('no solution')
return
else:
moves.reverse() # Show solution moves in correct order
costs.reverse() # Show solution moves in correct order
sol_path.reverse() # Show solution moves in correct order
i = 0
# Export solution path to solution file
for state in sol_path:
sol_f.write(str(moves[i]) + ' ') # Write the tile moved
sol_f.write(str(costs[i]) + ' ') # Write how much the move cost
sol_f.write((' '.join(str(tile) for tile in state)).replace('[', '').replace(']', '').replace(', ', ' ')) # Write the state of the board after the move
sol_f.write('\n')
i += 1
# Export search path to search file
if(algo == 'UCS'):
for node in srch_path:
srch_f.write('0 ') # Write f(n) as 0
srch_f.write(str(node.gn)) # Write g(n)
srch_f.write(' 0 ') # Write h(n) as 0
srch_f.write(str(node.state).replace('[', '').replace(']', '').replace(', ', ' '))
srch_f.write('\n')
elif(algo == 'GBFS'):
for node in srch_path:
srch_f.write('0 0 ') # Write f(n) and g(n) as 0
srch_f.write(str(node.hn) + ' ') # Write h(n)
srch_f.write(str(node.state).replace('[', '').replace(']', '').replace(', ', ' '))
srch_f.write('\n')
elif(algo == 'A*'):
for node in srch_path:
srch_f.write(str(node.fn) + ' ') # Write f(n)
srch_f.write(str(node.gn) + ' ') # Write g(n)
srch_f.write(str(node.hn) + ' ') # Write h(n)
srch_f.write(str(node.state).replace('[', '').replace(']', '').replace(', ', ' '))
srch_f.write('\n')
sol_f.write(str(total_cost) + ' ') # Write total cost
sol_f.write(str(round(end_time, 1))) # Write total computation time
print('Solution exported to ' + sol_file_name + '!')
print('Search path exported to ' + srch_file_name + '!\n')
sol_f.close()
srch_f.close()
"""
Function which generates 50 random/unique puzzles and exports them to a file
"""
def generate50Puzzles():
puzzle_values = [0,1,2,3,4,5,6,7]
puzzles = []
while(len(puzzles) < 50):
puzzle = random.sample(puzzle_values, len(puzzle_values))
if(puzzle not in puzzles):
puzzles.append(puzzle)
# Export puzzles to file
puzzles_file = open('50puzzles.txt', 'w')
for puzzle in puzzles:
puzzles_file.write(str(puzzle).replace('[', '').replace(']', '').replace(', ', ' ') + '\n') # formatting
"""
Function which counts the total number of lines in all the files inside of the solution and search output directories
also outputs total cost and execution time of successful runs
"""
def getMetrics():
solutions_dir = curr_dir + '/solution_files/'
search_dir = curr_dir + '/search_files/'
sols_total = 0
search_total = 0
no_sols = 0
cost = 0
exec_time = 0
for filename in os.listdir(solutions_dir):
with open(solutions_dir + filename) as f:
lines = [line.strip("\n") for line in f if line != "\n"]
if('solution' in lines[0]):
no_sols += 1
else:
sols_total += (len(lines)-1)
metrics = [float(i) for i in lines[len(lines)-1].split()]
cost += metrics[0]
exec_time += metrics[1]
for filename in os.listdir(search_dir):
with open(search_dir + filename) as f:
lines = [line.strip("\n") for line in f if line != "\n"]
if('solution' in lines[0]):
continue
else:
search_total += len(lines)
return (search_total, sols_total, no_sols, cost, exec_time)
"""
Function which deletes the solution and search output directories along with their nested files
"""
def clearOldOutputs():
solutions_dir = curr_dir + '/solution_files/'
search_dir = curr_dir + '/search_files/'
# Deletes directories for output files
try:
shutil.rmtree(solutions_dir)
shutil.rmtree(search_dir)
except OSError:
pass # ignore any errors
"""
Function which returns the index of the node in the closed list, or -1 if not found
"""
def index(item, lst):
states = [x.state for x in lst]
try:
return states.index(item)
except:
return -1
"""
Function which returns the index of the specified value in a given list
"""
def find(arr, value):
max_row = len(arr) - 1
max_col = len(arr[1]) - 1
for row in range(max_row+1):
for col in range(max_col+1):
if arr[row][col] == value:
return (row, col)
"""
Function which returns the lowest possible cost to move from t_coords to g_coords (in 2x4 puzzle)
"""
def getLowestCost(t_row, t_col, g_row, g_col):
diff = (abs(t_row - g_row) + abs(t_col - g_col))
if(diff == 1):
return 1
elif(diff == 2 or diff == 3):
return 2
else:
return 4