Optimal_path_with_AI_search/sample.txt at main · lywangj/Optimal_path_with_AI_search · GitHub

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
Searching by bfs ...
Minimum steps: 5, Total steps: 1118480
Time taken by breadth first search: 15530117 microseconds

Array 0 :
0 0 0 0
0 0 0 1
0 1 0 1
0 1 0 0

Array 3 :
0 1 0 0
0 0 0 1
0 0 0 1
0 1 0 0

Array 56 :
0 1 0 1
0 0 0 1
0 0 0 0
0 1 0 0

Array 905 :
1 0 1 0
0 0 0 1
0 0 0 0
0 1 0 0

Array 14483 :
1 1 1 0
0 0 0 1
0 0 0 0
0 0 0 0

Array 231736 :
1 1 1 1
0 0 0 0
0 0 0 0
0 0 0 0


Searching by A* search ...
Minimum steps: 5, Total steps: 96
Time taken by A* search: 1668 microseconds

Array 0 :
0 0 0 0
0 0 0 1
0 1 0 1
0 1 0 0

Array 3 :
0 1 0 0
0 0 0 1
0 0 0 1
0 1 0 0

Array 24 :
0 1 0 1
0 0 0 1
0 0 0 0
0 1 0 0

Array 41 :
1 0 1 0
0 0 0 1
0 0 0 0
0 1 0 0

Array 51 :
1 1 1 0
0 0 0 1
0 0 0 0
0 0 0 0

Array 88 :
1 1 1 1
0 0 0 0
0 0 0 0
0 0 0 0