Написать программу, которая будет искать оптимальное решение для сбора пятнашек
20.12.2015, 13:11. Показов 885. Ответов 0
Всем привет. Выдали задачу в универе написать программу, которая будет искать оптимальное решение для сбора пятнашек. После пару дней блуждания в интернете, нашел достаточно простой пример на питоне и решил, переписать его на плюсы. Вроде логику программы учел, но вылетают ошибки.
| Python | 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
| import pprint
import checker
pp = pprint.PrettyPrinter(indent=4)
class PuzzleSolver:
def puzz_astar(self, start, end):
"""
A* algorithm.
"""
start = str(start)
front = [[self.manhattan_distance(start, end), start]]
expanded = []
expanded_nodes = 0
while front:
i = 0
for j in range(1, len(front)):
if front[i][0] > front[j][0]:
i = j
path = front[i]
front = front[:i] + front[i + 1:]
endnode = path[-1]
if endnode == end:
break
if endnode in expanded:
continue
for k in self.moves(endnode):
if k in expanded:
continue
newpath = [path[0] + self.manhattan_distance(k, end) - self.manhattan_distance(endnode, end)] + path[1:] + [k]
front.append(newpath)
expanded.append(endnode)
expanded_nodes += 1
print ("Expanded nodes:", expanded_nodes)
print ("Solution: in", len(path) / 4, 'moves')
pp.pprint(path)
def moves(self, mat):
"""
Returns a list of all possible moves
"""
output = []
m = eval(mat)
i = 0
while 0 not in m[i]:
i += 1
j = m[i].index(0) # blank space (zero)
if i > 0:
m[i][j], m[i - 1][j] = m[i - 1][j], m[i][j] # move up
output.append(str(m))
m[i][j], m[i - 1][j] = m[i - 1][j], m[i][j]
if i < 3:
m[i][j], m[i + 1][j] = m[i + 1][j], m[i][j] # move down
output.append(str(m))
m[i][j], m[i + 1][j] = m[i + 1][j], m[i][j]
if j > 0:
m[i][j], m[i][j - 1] = m[i][j - 1], m[i][j] # move left
output.append(str(m))
m[i][j], m[i][j - 1] = m[i][j - 1], m[i][j]
if j < 3:
m[i][j], m[i][j + 1] = m[i][j + 1], m[i][j] # move right
output.append(str(m))
m[i][j], m[i][j + 1] = m[i][j + 1], m[i][j]
return output
def manhattan_distance(self, puzz, end):
"""
Manhettan distance heuristic
"""
m = eval(puzz)
a = eval(end)
lst = []
result = 0
for x in range(4):
for y in range(4):
if a[x][y] == 0:
continue
lst.append([[x, y], a[x][y]])
for i in range(4):
for j in range(4):
if m[i][j] == 0:
continue
for s in lst:
if s[1] == m[i][j]:
x = s[0][0]
y = s[0][1]
result += abs(i - x) + abs(j - y)
return result
if __name__ == '__main__':
puzzle = [[1, 2, 6, 3], [4, 9, 5, 7], [8, 13, 11, 15], [12, 10, 14, 0]]
end = str([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 0]])
puzz = PuzzleSolver()
check = checker.Checker()
if check.check_solution(list(puzzle)):
puzz.puzz_astar(puzzle, end) |
|
А это мой код на плюсах
Solver.h
| C++ | 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
226
227
228
229
230
231
| #pragma once
#include <algorithm>
#include "Checker.h"
using namespace std;
class PuzzleSolver
{
struct Node
{
int x;
int y;
int Num;
};
struct Bubl
{
vector<vector<int>> arr;
};
struct NodeFront
{
int distance;
vector<Bubl> arr;
};
public:
void puzz_astar(vector<vector<int>> start, vector<vector<int>> end)
{
/*
A* algorithm.
*/
vector<NodeFront> front;
Bubl start_node = { start };
NodeFront temp_node;
temp_node.arr.push_back(start_node);
temp_node.distance = manhattan_distance(start, end);
front.push_back(temp_node);
vector<Bubl> expanded;
int expanded_nodes = 0;
vector<NodeFront> path;
vector<vector<int>> endnode;
int counter_i,
counter_j;
while (true)
{
counter_i = 0;
for (counter_j = 1; counter_j < front.size(); counter_j++)
if (front[counter_i].distance > front[counter_j].distance)
counter_i = counter_j;
path.push_back(front[counter_i]);
front.clear();
NodeFront node_front = { front[counter_i].distance, front[counter_i].arr };
front.push_back(node_front);
endnode = path[-1].arr[-1].arr;
if (endnode == end)
break;
if(find(expanded.begin(), expanded.end(), endnode) != expanded.end())
continue;
bool expanded_in_k[2];
expanded_in_k[0] = false;
expanded_in_k[1] = false;
vector<Bubl> move = moves(endnode);
for (int k = 0; k < moves(endnode).size(); k++)
{
if (expanded_in_k[0]) continue;;
for (counter_i = 0; counter_i < 4; counter_i++)
{
if (expanded_in_k[0]) break;
for (counter_j = 0; counter_j < 4; counter_j++)
{
if (find(expanded.begin(), expanded.end(), move[k].arr[counter_i][counter_j]) != expanded.end())
{
expanded_in_k[0] = true;
break;
}
}
}
Bubl start_node_new = { move[k].arr };
NodeFront temp_node_new;
temp_node_new.arr.push_back(start_node_new);
temp_node_new.distance = 0;
path.push_back(temp_node_new);
NodeFront newpath = { path[0].distance + manhattan_distance(move[k].arr, end) - manhattan_distance(endnode, end), path[0].arr };
front.push_back(newpath);
Bubl rew = { endnode };
expanded.push_back(rew);
}
expanded_nodes += 1;
}
cout << "Expanded nodes:" << expanded_nodes;
cout << "Solution: in" << path.size() / 4 << "moves";
}
vector<Bubl> moves(vector<vector<int>> mat)
{
/*
Returns a list of all possible moves
*/
vector<Bubl> output;
vector<vector<int>> m = mat;
int i = 0;
int counter_j;
int j;
while (0 != m[i][j])
{
i += 1;
for (counter_j = 0; counter_j < 4; counter_j++)
if (m[i][counter_j] == 0)
j = counter_j; // blank space(zero)
if (i > 0)
{
int temp = m[i][j];
m[i - 1][j] = m[i][j];
temp = m[i - 1][j]; // move up
Bubl rew = { m };
output.push_back(rew);
temp = m[i][j];
m[i - 1][j] = m[i][j];
temp = m[i - 1][j];
}
if (i < 3)
{
int temp = m[i][j];
m[i + 1][j] = m[i][j];
temp = m[i + 1][j]; // move down
Bubl rew = { m };
output.push_back(rew);
temp = m[i][j];
m[i + 1][j] = m[i][j];
temp = m[i + 1][j];
}
if (j > 0)
{
int temp = m[i][j];
m[i][j - 1] = m[i][j];
temp = m[i][j - 1]; // move left
Bubl rew = { m };
output.push_back(rew);
temp = m[i][j];
m[i][j - 1] = m[i][j];
temp = m[i][j - 1];
}
if (j < 3)
{
int temp = m[i][j];
m[i][j + 1] = m[i][j];
temp = m[i][j + 1]; // move right
Bubl rew = { m };
output.push_back(rew);
temp = m[i][j];
m[i][j + 1] = m[i][j];
temp = m[i][j + 1];
}
}
return output;
}
int manhattan_distance(vector<vector<int>>puzz, vector<vector<int>>end)
{
/*
Manhettan distance heuristic
*/
vector<vector<int>> m = puzz; // = eval(puzz)
vector<vector<int>> a = end; // = eval(end)
vector<Node> lst;
int result = 0;
int counter_x,
counter_y,
counter_i,
counter_j;
for (counter_x = 0; counter_x < 4; counter_x++)
{
for (counter_y = 0; counter_y < 4; counter_y++)
{
if (!a[counter_x][counter_y]) continue;
Node temp_node = { counter_x, counter_y, a[counter_x][counter_y] };
lst.push_back(temp_node);
}
}
int x,
y;
for (counter_i = 0; counter_i < 4; counter_i++)
{
for (counter_j = 0; counter_j < 4; counter_j++)
{
if (!m[counter_x][counter_y]) continue;
for (int s = 0; s < lst.size(); s++)
{
if (lst[s].Num == m[counter_x][counter_y])
{
x = lst[s].x;
y = lst[s].y;
}
}
result += abs(counter_i - x) + abs(counter_j - y);
}
}
return result;
}
}; |
|
Programm.cpp
| C++ | 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
| #include <iostream>
#include <stdlib.h>
#include <vector>
#include "Solver.h"
using namespace std;
int main()
{
vector<vector<int>> puzzle = { { 1, 2, 6, 3 },{ 4, 9, 5, 7 },{ 8, 13, 11, 15 },{ 12, 10, 14, 0 } };
vector<vector<int>> end = { { 1, 2, 3, 4 },{ 5, 6, 7, 8 },{ 9, 10, 11, 12 },{ 13, 14, 15, 0 } };
PuzzleSolver puzz;
puzz.puzz_astar(puzzle, end);
system("pause");
return 1;
} |
|
Ошибки
| Code | 1
2
3
| Ошибка C2678 бинарный "==": не найден оператор, принимающий левый операнд типа "PuzzleSolver::Bubl" (или приемлемое преобразование отсутствует)
Ошибка C2446 ==: нет преобразования "const int" в "PuzzleSolver::Bubl"
Ошибка C2088 ==: недопустимо для struct |
|
Буду рад любой помощи.
0
|
(
