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
|
/*
* Copyright 2007-2008 Thomas Gallinari <tg8187@yahoo.fr>
* Copyright 2007-2008 Pierre-Benoît Besse <besse.pb@gmail.com>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of
* the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "maze.h"
#include <KDebug>
#include <math.h>
Maze::Maze() : m_totalNbElem(0), m_nbElem(0) {
}
Maze::~Maze() {
for(int i = 0 ; i < m_nbRows; ++i) {
delete[] m_cells[i];
}
delete[] m_cells;
}
void Maze::init(const int p_nbRows, const int p_nbColumns) {
m_nbRows = p_nbRows;
m_nbColumns = p_nbColumns;
m_cells = new Cell*[m_nbRows];
for (int i = 0; i < m_nbRows; ++i) {
m_cells[i] = new Cell[m_nbColumns];
}
}
void Maze::setCellType(const int p_row, const int p_column, const Cell::Type p_type) {
if (p_row < 0 || p_row >= m_nbRows || p_column < 0 || p_column >= m_nbColumns) {
kError() << "Bad maze coordinates";
}
m_cells[p_row][p_column].setType(p_type);
}
void Maze::setCellElement(const int p_row, const int p_column, Element * p_element) {
if (p_row < 0 || p_row >= m_nbRows || p_column < 0 || p_column >= m_nbColumns) {
kError() << "Bad maze coordinates";
}
m_cells[p_row][p_column].setElement(p_element);
if (p_element != NULL) {
m_totalNbElem++;
m_nbElem++;
}
}
void Maze::setResurrectionCell(QPoint p_resurrectionCell) {
// TODO : COORDINATES INVERTED, NEED TO CORRECT IT in the findPAth algorithm
m_resurrectionCell.setX(p_resurrectionCell.y());
m_resurrectionCell.setY(p_resurrectionCell.x());
}
void Maze::decrementNbElem() {
m_nbElem--;
if (m_nbElem == 0) {
emit(allElementsEaten());
}
}
void Maze::resetNbElem() {
m_nbElem = m_totalNbElem;
}
QList<QPoint> Maze::getPathToGhostCamp(const int p_row, const int p_column) const {
QList<QPoint> path;
QList<QPoint> openList;
QList<QPoint> closedList;
QPoint currentCell;
QPoint tmpCell;
int lowestCost;
int icurrent = 0;
int oldSize = 0;
// Initialize the starting cell
m_cells[p_row][p_column].setCost(abs(m_resurrectionCell.y() - p_row) + abs(m_resurrectionCell.x() - p_column));
// Add the starting cell to the openList
openList.append(QPoint(p_column, p_row));
// While the closed list does not contain the target cell
while (!closedList.contains(QPoint(m_resurrectionCell.x(), m_resurrectionCell.y())) && openList.size() != oldSize) {
// Look for the lowest cost cell on the open list
lowestCost = 1000;
for (int i = 0; i < openList.size(); ++i) {
if (m_cells[openList[i].y()][openList[i].x()].getCost() < lowestCost) {
lowestCost = m_cells[openList[i].y()][openList[i].x()].getCost();
currentCell = openList[i];
icurrent = i;
}
}
// Switch this cell to the closed list
closedList.append(currentCell);
openList.removeAt(icurrent);
oldSize = openList.size();
// For each of the 4 cells adjacent to the current node
// Left
tmpCell.setX(currentCell.x() - 1);
tmpCell.setY(currentCell.y());
if (m_cells[tmpCell.y()][tmpCell.x()].getType() != Cell::WALL) {
// If the cell is not in the closed list or the open list
if (!closedList.contains(tmpCell) && !openList.contains(tmpCell)) {
// Initialize the cell
m_cells[tmpCell.y()][tmpCell.x()].setCost(
abs(m_resurrectionCell.y() - tmpCell.y()) + abs(m_resurrectionCell.x() - (tmpCell.x())));
m_cells[tmpCell.y()][tmpCell.x()].setParent(&m_cells[currentCell.y()][currentCell.x()]);
// Add it to the open list
openList.append(tmpCell);
}
}
// Right
tmpCell.setX(currentCell.x() + 1);
tmpCell.setY(currentCell.y());
if (m_cells[tmpCell.y()][tmpCell.x()].getType() != Cell::WALL) {
// If the cell is not in the closed list or the open list
if (!closedList.contains(tmpCell) && !openList.contains(tmpCell)) {
// Initialize the cell
m_cells[tmpCell.y()][tmpCell.x()].setCost(
abs(m_resurrectionCell.y() - tmpCell.y()) + abs(m_resurrectionCell.x() - (tmpCell.x())));
m_cells[tmpCell.y()][tmpCell.x()].setParent(&m_cells[currentCell.y()][currentCell.x()]);
// Add it to the open list
openList.append(tmpCell);
}
}
// Top
tmpCell.setX(currentCell.x());
tmpCell.setY(currentCell.y() - 1);
if (m_cells[tmpCell.y()][tmpCell.x()].getType() != Cell::WALL) {
// If the cell is not in the closed list or the open list
if (!closedList.contains(tmpCell) && !openList.contains(tmpCell)) {
// Initialize the cell
m_cells[tmpCell.y()][tmpCell.x()].setCost(
abs(m_resurrectionCell.y() - tmpCell.y()) + abs(m_resurrectionCell.x() - (tmpCell.x())));
m_cells[tmpCell.y()][tmpCell.x()].setParent(&m_cells[currentCell.y()][currentCell.x()]);
// Add it to the open list
openList.append(tmpCell);
}
}
// Bottom
tmpCell.setX(currentCell.x());
tmpCell.setY(currentCell.y() + 1);
if (m_cells[tmpCell.y()][tmpCell.x()].getType() != Cell::WALL) {
// If the cell is not in the closed list or the open list
if (!closedList.contains(tmpCell) && !openList.contains(tmpCell)) {
// Initialize the cell
m_cells[tmpCell.y()][tmpCell.x()].setCost(
abs(m_resurrectionCell.y() - tmpCell.y()) + abs(m_resurrectionCell.x() - (tmpCell.x())));
m_cells[tmpCell.y()][tmpCell.x()].setParent(&m_cells[currentCell.y()][currentCell.x()]);
// Add it to the open list
openList.append(tmpCell);
}
}
}
if (oldSize == openList.size()) {
kError() << "Path to ghost home not found";
return QList<QPoint>();
}
// Save the path : from the target cell, go from each cell to its parent cell until reaching the starting cell
for (Cell* cell = &m_cells[m_resurrectionCell.y()][m_resurrectionCell.x()];
cell->getParent() != &m_cells[p_row][p_column]; cell = cell->getParent()) {
path.prepend(getCoords(cell));
}
return path;
}
Cell Maze::getCell(const int p_row, const int p_column) const {
if (p_row < 0 || p_row >= m_nbRows ||
p_column < 0 || p_column >= m_nbColumns) {
kError() << "Bad maze coordinates";
}
return m_cells[p_row][p_column];
}
QPoint Maze::getCoords(Cell* p_cell) const {
for (int i = 0; i < m_nbRows; ++i) {
for (int j = 0; j < m_nbColumns; ++j) {
if (&m_cells[i][j] == p_cell) {
return QPoint(j, i);
}
}
}
return QPoint();
}
int Maze::getRowFromY(const qreal p_y) const {
return (int)(p_y / Cell::SIZE);
}
int Maze::getColFromX(const qreal p_x) const {
return (int)(p_x / Cell::SIZE);
}
int Maze::getNbColumns() const {
return m_nbColumns;
}
int Maze::getNbRows() const {
return m_nbRows;
}
int Maze::getNbElem() const {
return m_nbElem;
}
int Maze::getTotalNbElem() const {
return m_totalNbElem;
}
QPoint Maze::getResurrectionCell() const {
return m_resurrectionCell;
}
|