-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathastar.py
188 lines (174 loc) · 6.26 KB
/
astar.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
from puzzle import Puzzle
import heapq
class Astar:
def __init__(self, puzzle, g):
self.puzzle = puzzle
self.parent = None
self.g = g
self.f= 0
self.f1 = self.puzzle.h1 + self.g
self.f2 = self.puzzle.h2 + self.g
self.f3 = self.puzzle.h3 + self.g
def set_f2(self):
self.f2 = self.puzzle.h2 + self.g
self.f=self.f2
return
def set_f1(self):
self.f1 = self.puzzle.h1 + self.g
self.f=self.f1
return
def set_f3(self):
self.f3 = self.puzzle.h3 + self.g
self.f=self.f3
return
def findzero(self, puzzle):
for i in range(puzzle.size):
for j in range(puzzle.size):
if (puzzle.board[i][j] == 0):
return i, j
def solve1(self):
pqueue = []
seen = set()
nodecount= 0
g = 0
self.f= self.puzzle.h1 + self.g
heapq.heappush(pqueue,self)
seen.add(hash(str(self.puzzle.board)))
while True:
# evaluates node in priority queue with smallest f case
node = heapq.heappop(pqueue)
g = node.g + 1
x, y = self.findzero(node.puzzle)
coords = [[x, y-1], [x, y+1], [x-1, y], [x+1, y]]
for i in coords:
new_puzzle = Puzzle.moves(node.puzzle, x, y, i[0], i[1])
if new_puzzle:
new_puzzle.set_h1()
if new_puzzle.h1 == 0:
child = Astar(new_puzzle, g)
child.parent = node
node = child
break
puz=hash(str(new_puzzle.board))
if (puz not in seen): #fix, NEVER NOT IN SEEN
nodecount+=1
seen.add(puz)
child = Astar(new_puzzle, g) # create child
child.parent = node
child.set_f1()
heapq.heappush(pqueue,child) # add to queue
# sort queue
if (node.puzzle.h1 == 0):
route = []
#print("\n")
#print("ROUTE:\n")
steps = 0
while node is not None:
route.append(node)
node = node.parent
steps += 1
#route.reverse()
#print("Number of steps: ")
#print(steps)
#for state in route:
#print(state.puzzle)
break
return steps, nodecount
def solve2(self):
pqueue = []
seen = set()
nodecount= 0
g = 0
self.f=self.puzzle.h2 + self.g
heapq.heappush(pqueue,self)
seen.add(hash(str(self.puzzle.board)))
while True:
# evaluates node in priority queue with smallest f case
node = heapq.heappop(pqueue)
g = node.g + 1
x, y = self.findzero(node.puzzle)
coords = [[x, y-1], [x, y+1], [x-1, y], [x+1, y]]
for i in coords:
new_puzzle = Puzzle.moves(node.puzzle, x, y, i[0], i[1])
if new_puzzle:
new_puzzle.set_h2()
if new_puzzle.h2 == 0:
child = Astar(new_puzzle, g)
child.parent = node
node = child
break
puz=hash(str(new_puzzle.board))
if (puz not in seen): #fix, NEVER NOT IN SEEN
nodecount+=1
seen.add(puz)
child = Astar(new_puzzle, g) # create child
child.parent = node
child.set_f2()
heapq.heappush(pqueue,child) # add to queue
# sort queue
if (node.puzzle.h2 == 0):
route = []
#print("\n")
#print("ROUTE:\n")
steps = 0
while node is not None:
route.append(node)
node = node.parent
steps += 1
#route.reverse()
#print("Number of steps: ")
#print(steps)
#for state in route:
#print(state.puzzle)
break
return steps, nodecount
def solve3(self):
pqueue = []
seen = set()
nodecount= 0
g = 0
self.f=self.puzzle.h3 + self.g
heapq.heappush(pqueue,self)
seen.add(hash(str(self.puzzle.board)))
while True:
# evaluates node in priority queue with smallest f case
node = heapq.heappop(pqueue)
g = node.g + 1
x, y = self.findzero(node.puzzle)
coords = [[x, y-1], [x, y+1], [x-1, y], [x+1, y]]
for i in coords:
new_puzzle = Puzzle.moves(node.puzzle, x, y, i[0], i[1])
if new_puzzle:
new_puzzle.set_h3()
if new_puzzle.h3 == 0:
child = Astar(new_puzzle, g)
child.parent = node
node = child
break
puz=hash(str(new_puzzle.board))
if (puz not in seen): #fix, NEVER NOT IN SEEN
nodecount+=1
seen.add(puz)
child = Astar(new_puzzle, g) # create child
child.parent = node
child.set_f3()
heapq.heappush(pqueue,child) # add to queue
# sort queue
if (node.puzzle.h3 == 0):
route = []
#print("\n")
#print("ROUTE:\n")
steps = 0
while node is not None:
route.append(node)
node = node.parent
steps += 1
#route.reverse()
#print("Number of steps: ")
#print(steps)
#for state in route:
#print(state.puzzle)
break
return steps, nodecount
def __lt__(self, other):
return self.f < other.f