-
Notifications
You must be signed in to change notification settings - Fork 7
/
main.py
227 lines (190 loc) · 6.94 KB
/
main.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
from graphviz import Digraph
import os
import copy
counter = 1
class State(object):
def __init__(self, self_state, parent_id, parent_move, level):
global counter
self.self_id = counter
self.self_state = self_state
self.parent_id = parent_id
self.parent_move = parent_move
self.level = level
self.l_child = -1
self.u_child = -1
self.r_child = -1
self.d_child = -1
counter += 1
def set_child(self, state_id, move):
if move == "left":
self.l_child = state_id
elif move == "right":
self.r_child = state_id
elif move == "up":
self.u_child = state_id
elif move == "down":
self.d_child = state_id
def __repr__(self):
return str(self.self_state[0])+"\n"+str(self.self_state[1])+"\n"+str(self.self_state[2])
def create_child(parent_state, move):
i = 0
j = 0
found = False
matrix = copy.deepcopy(parent_state)
for i in range(0, 3):
for j in range(0, 3):
if parent_state[i][j] == 0:
found = True
break
if found:
break
if move == "left":
if j == 0:
return -1
else:
matrix[i][j] = matrix[i][j - 1]
matrix[i][j - 1] = 0
return matrix
if move == "right":
if j == 2:
return -1
else:
matrix[i][j] = matrix[i][j + 1]
matrix[i][j + 1] = 0
return matrix
if move == "up":
if i == 0:
return -1
else:
matrix[i][j] = matrix[i - 1][j]
matrix[i - 1][j] = 0
return matrix
if move == "down":
if i == 2:
return -1
else:
matrix[i][j] = matrix[i + 1][j]
matrix[i + 1][j] = 0
return matrix
def bfs_search():
global state_space_tree
global id_to_state
parent_state = id_to_state[1]
dot = Digraph(comment='BFS graph')
dot.node(str(parent_state.self_id), parent_state.__str__())
queue = [parent_state]
while(len(queue) != 0):
current_state = queue.pop(0)
if current_state.u_child != -1:
child_state = id_to_state[current_state.u_child]
queue.append(child_state)
# graph
dot.node(str(child_state.self_id), child_state.__str__())
dot.edge(str(current_state.self_id), str(child_state.self_id), label="up")
if child_state.self_state == final_state:
break
if current_state.l_child != -1:
child_state = id_to_state[current_state.l_child]
queue.append(child_state)
# graph
dot.node(str(child_state.self_id), child_state.__str__())
dot.edge(str(current_state.self_id), str(child_state.self_id), label="left")
if child_state.self_state == final_state:
break
if current_state.d_child != -1:
child_state = id_to_state[current_state.d_child]
queue.append(child_state)
# graph
dot.node(str(child_state.self_id), child_state.__str__())
dot.edge(str(current_state.self_id), str(child_state.self_id), label="down")
if child_state.self_state == final_state:
break
if current_state.r_child != -1:
child_state = id_to_state[current_state.r_child]
queue.append(child_state)
# graph
dot.node(str(child_state.self_id), child_state.__str__())
dot.edge(str(current_state.self_id), str(child_state.self_id), label="right")
if child_state.self_state == final_state:
break
dot.render(str(os.getcwd() + '/outputs/BFS_graph.gv'), view=True)
initial_state = [[0, 1, 3],
[6, 2, 4],
[7, 5, 8]]
final_state = [[1, 2, 3],
[6, 5, 4],
[7, 8, 0]]
visited = []
goal_found = False
dot_dfs = Digraph(comment='DFS graph')
def dfs(node):
global visited
global dot_dfs
global goal_found
if goal_found:
return
if node not in visited:
visited.append(node)
dot_dfs.node(str(node.self_id), node.__str__())
dot_dfs.edge(str(node.parent_id), str(node.self_id), label=node.parent_move)
if node.self_state == final_state:
goal_found = True
return
if node.u_child != -1:
child_state = id_to_state[node.u_child]
dfs(child_state)
if node.l_child != -1:
child_state = id_to_state[node.l_child]
dfs(child_state)
if node.d_child != -1:
child_state = id_to_state[node.d_child]
dfs(child_state)
if node.r_child != -1:
child_state = id_to_state[node.r_child]
dfs(child_state)
state_space_tree = dict()
id_to_state = dict()
if __name__ == "__main__":
# state_space_tree
# global id_to_state
# for graph
dot = Digraph(comment='State space graph')
opposite_movements = {"up": "down", "down": "up", "left": "right", "right": "left"}
goal_found = False
current_state = State(initial_state, 1, "null", 1)
id_to_state[1] = current_state
explore_queue = [current_state.self_id]
dot.node(str(current_state.self_id), current_state.__str__())
goal_lvl = 9999
while (True):
current_state = id_to_state[explore_queue.pop(0)]
if current_state.level > goal_lvl + 1:
break
parent_move = current_state.parent_move
possible_movements = ["up", "left", "down", "right"]
if (parent_move != "null"):
possible_movements.remove(opposite_movements[parent_move])
childs = []
for move in possible_movements:
matrix = create_child(current_state.self_state, move)
if matrix != -1:
state_obj = State(matrix, current_state.self_id, move, current_state.level+1)
current_state.set_child(state_obj.self_id, move)
# put the child id to queue
explore_queue.append(state_obj.self_id)
# save the child object
id_to_state[state_obj.self_id] = state_obj
childs.append(state_obj.self_id)
# check if this child is the goal state
if matrix == final_state and goal_lvl == 9999:
goal_lvl = state_obj.level - 1
if matrix == final_state:
dot.node(str(state_obj.self_id), state_obj.__str__(), color='green')
else:
dot.node(str(state_obj.self_id), state_obj.__str__())
dot.edge(str(state_obj.parent_id), str(state_obj.self_id), label=move)
dot.render(str(os.getcwd() + '/outputs/state_space_tree.gv'), view=True)
bfs_search()
parent = id_to_state[1]
dfs(parent)
dot_dfs.render(str(os.getcwd() + '/outputs/DFS_graph.gv'), view=True)