-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdata.txt
More file actions
135 lines (135 loc) · 10.7 KB
/
data.txt
File metadata and controls
135 lines (135 loc) · 10.7 KB
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
astar_search:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,696 nodes | 190 goal | 10 cost | 204 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 35 cost | 45 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
15 nodes | 6 goal | 418 cost | 9 actions | RouteProblem('A', 'B')
34 nodes | 15 goal | 910 cost | 23 actions | RouteProblem('N', 'L')
33 nodes | 14 goal | 805 cost | 21 actions | RouteProblem('E', 'T')
20 nodes | 9 goal | 445 cost | 13 actions | RouteProblem('O', 'M')
15 nodes | 6 goal | 5 cost | 10 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
uniform_cost_search:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,696 nodes | 190 goal | 10 cost | 204 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 35 cost | 45 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
30 nodes | 13 goal | 418 cost | 16 actions | RouteProblem('A', 'B')
42 nodes | 19 goal | 910 cost | 27 actions | RouteProblem('N', 'L')
44 nodes | 20 goal | 805 cost | 27 actions | RouteProblem('E', 'T')
30 nodes | 12 goal | 445 cost | 16 actions | RouteProblem('O', 'M')
124 nodes | 46 goal | 5 cost | 50 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
breadth_first_search:
596 nodes | 597 goal | 4 cost | 73 actions | PourProblem((1, 1, 1), 13)
596 nodes | 597 goal | 15 cost | 73 actions | GreenPourProblem((1, 1, 1), 13)
2,618 nodes | 2,619 goal | 9 cost | 302 actions | PourProblem((0, 0, 0), 21)
2,618 nodes | 2,619 goal | 32 cost | 302 actions | GreenPourProblem((0, 0, 0), 21)
120 nodes | 121 goal | 14 cost | 42 actions | PourProblem((0, 0), 8)
120 nodes | 121 goal | 36 cost | 42 actions | GreenPourProblem((0, 0), 8)
2,618 nodes | 2,619 goal | 9 cost | 302 actions | PourProblem((0, 0, 0), 21)
2,618 nodes | 2,619 goal | 32 cost | 302 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
18 nodes | 19 goal | 450 cost | 10 actions | RouteProblem('A', 'B')
42 nodes | 43 goal | 1085 cost | 27 actions | RouteProblem('N', 'L')
36 nodes | 37 goal | 837 cost | 22 actions | RouteProblem('E', 'T')
30 nodes | 31 goal | 445 cost | 16 actions | RouteProblem('O', 'M')
81 nodes | 82 goal | 5 cost | 35 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
breadth_first_bfs:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,062 nodes | 124 goal | 15 cost | 127 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
3,757 nodes | 420 goal | 24 cost | 428 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 36 cost | 43 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
3,757 nodes | 420 goal | 24 cost | 428 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
28 nodes | 12 goal | 450 cost | 14 actions | RouteProblem('A', 'B')
55 nodes | 24 goal | 910 cost | 32 actions | RouteProblem('N', 'L')
51 nodes | 22 goal | 837 cost | 28 actions | RouteProblem('E', 'T')
40 nodes | 16 goal | 445 cost | 20 actions | RouteProblem('O', 'M')
124 nodes | 46 goal | 5 cost | 50 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
breadth_first_bfs:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,062 nodes | 124 goal | 15 cost | 127 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
3,757 nodes | 420 goal | 24 cost | 428 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 36 cost | 43 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
3,757 nodes | 420 goal | 24 cost | 428 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
28 nodes | 12 goal | 450 cost | 14 actions | RouteProblem('A', 'B')
55 nodes | 24 goal | 910 cost | 32 actions | RouteProblem('N', 'L')
51 nodes | 22 goal | 837 cost | 28 actions | RouteProblem('E', 'T')
40 nodes | 16 goal | 445 cost | 20 actions | RouteProblem('O', 'M')
124 nodes | 46 goal | 5 cost | 50 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
depth_limited_search:
4,433 nodes | 4,374 goal | 10 cost | 627 actions | PourProblem((1, 1, 1), 13)
4,433 nodes | 4,374 goal | 30 cost | 627 actions | GreenPourProblem((1, 1, 1), 13)
37,149 nodes | 37,106 goal | 10 cost | 4,753 actions | PourProblem((0, 0, 0), 21)
37,149 nodes | 37,106 goal | 54 cost | 4,753 actions | GreenPourProblem((0, 0, 0), 21)
452 nodes | 453 goal | inf cost | 110 actions | PourProblem((0, 0), 8)
452 nodes | 453 goal | inf cost | 110 actions | GreenPourProblem((0, 0), 8)
37,149 nodes | 37,106 goal | 10 cost | 4,753 actions | PourProblem((0, 0, 0), 21)
37,149 nodes | 37,106 goal | 54 cost | 4,753 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
17 nodes | 8 goal | 733 cost | 14 actions | RouteProblem('A', 'B')
40 nodes | 38 goal | 910 cost | 26 actions | RouteProblem('N', 'L')
29 nodes | 23 goal | 992 cost | 20 actions | RouteProblem('E', 'T')
35 nodes | 29 goal | 895 cost | 22 actions | RouteProblem('O', 'M')
351 nodes | 349 goal | 5 cost | 138 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
greedy_bfs:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,696 nodes | 190 goal | 10 cost | 204 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 35 cost | 45 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
9 nodes | 4 goal | 450 cost | 6 actions | RouteProblem('A', 'B')
29 nodes | 12 goal | 910 cost | 20 actions | RouteProblem('N', 'L')
19 nodes | 8 goal | 837 cost | 14 actions | RouteProblem('E', 'T')
14 nodes | 6 goal | 572 cost | 10 actions | RouteProblem('O', 'M')
15 nodes | 6 goal | 5 cost | 10 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
weighted_astar_search:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,696 nodes | 190 goal | 10 cost | 204 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 35 cost | 45 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
9 nodes | 4 goal | 450 cost | 6 actions | RouteProblem('A', 'B')
32 nodes | 14 goal | 910 cost | 22 actions | RouteProblem('N', 'L')
29 nodes | 12 goal | 805 cost | 19 actions | RouteProblem('E', 'T')
18 nodes | 8 goal | 445 cost | 12 actions | RouteProblem('O', 'M')
15 nodes | 6 goal | 5 cost | 10 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)
extra_weighted_astar_search:
948 nodes | 109 goal | 4 cost | 112 actions | PourProblem((1, 1, 1), 13)
1,696 nodes | 190 goal | 10 cost | 204 actions | GreenPourProblem((1, 1, 1), 13)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
124 nodes | 30 goal | 14 cost | 43 actions | PourProblem((0, 0), 8)
124 nodes | 30 goal | 35 cost | 45 actions | GreenPourProblem((0, 0), 8)
3,499 nodes | 389 goal | 9 cost | 397 actions | PourProblem((0, 0, 0), 21)
4,072 nodes | 454 goal | 21 cost | 463 actions | GreenPourProblem((0, 0, 0), 21)
0 nodes | 1 goal | 0 cost | 0 actions | RouteProblem('A', 'A')
9 nodes | 4 goal | 450 cost | 6 actions | RouteProblem('A', 'B')
29 nodes | 12 goal | 910 cost | 20 actions | RouteProblem('N', 'L')
23 nodes | 9 goal | 805 cost | 16 actions | RouteProblem('E', 'T')
18 nodes | 8 goal | 445 cost | 12 actions | RouteProblem('O', 'M')
15 nodes | 6 goal | 5 cost | 10 actions | EightPuzzle((1, 4, 2, 0, 7, 5, 3, 6, 8)