-
Notifications
You must be signed in to change notification settings - Fork 1
/
Ghost.cpp
281 lines (262 loc) · 6.48 KB
/
Ghost.cpp
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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
#include "Ghost.h"
Ghost::Ghost() :Object() {
int dx[4] = { 1,-1,0,0 }, dy[4] = { 0,0,1,-1 };
startLeft = 0;
srand(time(0));
canMove = 0;
ifstream g;
g.open("gpath.txt");
if (g.is_open())
{
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
if (!g.eof())
g >> gpath[i][j];
}
g.close();
//setting the adjacency list
int r, c, node;
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
{
if (gpath[i][j] == -1) //if a wall
continue;
node = gpath[i][j];
for (int k = 0; k < 4; k++)
{
r = i + dx[k]; c = j + dy[k];
if (r >= 0 && r < row && c >= 0 && c < col) //Not out of boundaries
{
graph[node].push_back(gpath[r][c]);
}
}
}
//To connect the left gate with the right gate
graph[71].push_back(85);
graph[85].push_back(71);
initialRow = 0;
initialColumn = 0;
memset(cost, -1, sizeof cost);
wait = 0;
}
Ghost::Ghost(string n, int initialR, int initialC, string imagename, bool sl) :Object(n, initialR, initialC, imagename)
{
int dx[4] = { 1,-1,0,0 }, dy[4] = { 0,0,1,-1 };
srand(time(0));
canMove = 0;
ifstream g;
g.open("gpath.txt");
if (g.is_open())
{
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
if (!g.eof())
g >> gpath[i][j];
}
g.close();
int r, c, node;
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
{
if (gpath[i][j] == -1)
continue;
node = gpath[i][j];
for (int k = 0; k < 4; k++)
{
r = i + dx[k]; c = j + dy[k];
if (r >= 0 && r < row && c >= 0 && c < col)
{
graph[node].push_back(gpath[r][c]);
}
}
}
memset(cost, -1, sizeof cost);
startLeft = sl;
if (sl)
{
if (gpath[initialRow][initialColumn] == 78)
wait = 3;
else if (gpath[initialRow][initialColumn] == 61)
wait = 1;
}
else
wait = 0;
}
void Ghost::setGhost(string n, int initialR, int initialC, string imagename1, string imagename2, string imagename3, bool can, bool sl) {
startLeft = sl;
canMove = can;
name = n;
initialRow = initialR;
initialColumn = initialC;
curRow = initialR;
curColumn = initialC;
updatePosition();
texture.loadFromFile(imagename1);
shape.setTexture(&texture);
shape.setSize(Vector2f(32, 32));
this->snapshot.resize(4);
snapshot[0].loadFromFile(imagename1);
snapshot[1].loadFromFile(imagename2);
snapshot[2].loadFromFile(imagename3);
snapshot[3].loadFromFile(imagename2);
if (sl)
{
if (gpath[initialRow][initialColumn] == 78)
wait = 3;
else if (gpath[initialRow][initialColumn] == 61)
wait = 1;
}
else
wait = 0;
}
//moving the ghost to a specific node (returned by getDirection)
void Ghost::move(int node)
{
if (canMove) //if the ghost can move
{
if (!wait) //if this is not from the initial obligatory left moves
{
bool f = 1;
for (int i = 0; i < row && f; i++)
for (int j = 0; j < col && f; j++)
if (gpath[i][j] == node)
{
curRow = i;
curColumn = j;
f = 0;
}
updatePosition();
}
//if this is from the initial obligatory left moves, then go left
//According to the initial position of the ghost, he will be obliged to number of moves to go left (which is the variable wait)
else
{
switch (wait)
{
case 3:
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
if (gpath[i][j] == 68)
{
curRow = i;
curColumn = j;
}
updatePosition();
wait--;
break;
case 2:
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
if (gpath[i][j] == 61)
{
curRow = i;
curColumn = j;
}
updatePosition();
wait--;
break;
case 1:
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
if (gpath[i][j] == 60)
{
curRow = i;
curColumn = j;
}
updatePosition();
wait--;
break;
}
}
}
}
void Ghost::freightMode() //To go into freight mode
{
shape.setFillColor(Color::Blue);
}
void Ghost::unFreight() //To go out of freight mode
{
shape.setFillColor(Color::White);
}
//Get the node that the ghost should go next
//BFS from pacman to the ghost , the adjascent node to the ghost that has less cost by 1 is the next node
int Ghost::getDirection(int x, int y, vector<int> occupied)
{
queue<pair<int, int> >q;
q.push(make_pair(gpath[x][y], 0));
pair<int, int> cur;
memset(cost, -1, sizeof cost);
memset(parent, -1, sizeof parent);
while (q.size())
{
cur = q.front();
q.pop();
if (cost[cur.first] != -1) continue;
cost[cur.first] = cur.second;
if (cur.first == gpath[curRow][curColumn])
break;
for (int i = 0; i < graph[cur.first].size(); i++)
{
if (cost[graph[cur.first][i]] == -1)
{
q.push(make_pair(graph[cur.first][i], cur.second + 1));
parent[graph[cur.first][i]] = cur.first;
}
}
}
while (q.size())
q.pop();
cur.first = parent[gpath[curRow][curColumn]];
if (cur.first == -1)
cur.first = gpath[x][y];
for (int i = 0; i < occupied.size(); i++)
if (occupied[i] == cur.first)
cur.first = gpath[curRow][curColumn];
return cur.first;
}
//Get the node that the ghost should go next in fright mode
//BFS from the ghost to the initial position, return back till you reach the node with cost 1, this is the next node
int Ghost::getFreightDirection(vector<int> occupied)
{
//if (gpath[curRow][curColumn] == gpath[initialRow][initialColumn])
//return gpath[curRow][curColumn];
queue<pair<int, int> >q;
q.push(make_pair(gpath[curRow][curColumn], 0));
pair<int, int> cur;
memset(cost, -1, sizeof cost);
while (q.size())
{
cur = q.front();
q.pop();
if (cost[cur.first] != -1) continue;
cost[cur.first] = cur.second;
if (cur.first == gpath[initialRow][initialColumn])
break;
for (int i = 0; i < graph[cur.first].size(); i++)
{
if (cost[graph[cur.first][i]] == -1)
q.push(make_pair(graph[cur.first][i], cur.second + 1));
}
}
while (q.size())
q.pop();
q.push(cur);
while (q.size())
{
cur = q.front();
q.pop();
if (cur.second == 1)
break;
for (int i = 0; i < graph[cur.first].size(); i++)
if (cost[graph[cur.first][i]] == cur.second - 1)
q.push(make_pair(graph[cur.first][i], cur.second - 1));
}
for (int i = 0; i < occupied.size(); i++)
if (occupied[i] == cur.first)
cur.first = gpath[curRow][curColumn];
return cur.first;
}
void Ghost::okMove(bool n)
{
canMove = n;
}