-
Notifications
You must be signed in to change notification settings - Fork 0
/
Board_Tile.cc
383 lines (343 loc) · 9.89 KB
/
Board_Tile.cc
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
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
#include "Board_Tile.h"
//#########################//
// //
// Constructors //
// //
//#########################//
Board_Tile::Board_Tile() {}
Board_Tile::Board_Tile(const std::string& ConfigString)
{
config(ConfigString);
}
//#########################//
// //
// Public Member Functions //
// //
//#########################//
//####################################
// Function : Manhattan_Distance
// Purpose : Calculate the A* Distance
// Using Manhattan Distance
//####################################
int Board_Tile::Manhattan_Distance(Board_Tile Goal)
{
int manhatton = 0;
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
{
int SEARCH = board[i][j];
if(SEARCH != 0)
{
int tempI = Goal.findX(SEARCH);
int tempJ = Goal.findY(SEARCH);
manhatton += (abs(i-tempI) + abs(j-tempJ));
}
}
// Calculate A* Distance w/ Manhatton Distance
MD = numMoves() + manhatton;
return MD; // This is The A* Distance
}
//####################################
// Function : findX
// Purpose : return the X coordinate
// of SEARCH in board
// (Used for Manhattan D)
//####################################
int Board_Tile::findX(int SEARCH)
{
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
if(board[i][j] == SEARCH)
return i;
return 0;
}
//####################################
// Function : findY
// Purpose : return the Y coordinate
// of SEARCH in board
// (Used for Manhattan D)
//####################################
int Board_Tile::findY(int SEARCH)
{
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
if(board[i][j] == SEARCH)
return j;
return 0;
}
//####################################
// Function : nextConfigs
// Purpose : return a list of the
// possible configurations
// relative to the '0' tile
//####################################
std::list<Board_Tile> Board_Tile::nextConfigs()
{
std::list<Board_Tile> ReturnList;
// search through the board for
// the tile 0
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
{
if (board[i][j] == 0)
// once found, do a switch statement
// to return a list of the possible
// Moves that can be made
switch(i)
{
case 0:
switch(j)
{
// 0,0
case 0:
ReturnList.push_back(m_BoardSwap(i,j,0,1));
ReturnList.push_back(m_BoardSwap(i,j,1,0));
break;
// 0,1
case 1:
ReturnList.push_back(m_BoardSwap(i,j,0,0));
ReturnList.push_back(m_BoardSwap(i,j,0,2));
ReturnList.push_back(m_BoardSwap(i,j,1,1));
break;
// 1,2
case 2:
ReturnList.push_back(m_BoardSwap(i,j,0,1));
ReturnList.push_back(m_BoardSwap(i,j,1,2));
break;
}
break;
case 1:
switch(j)
{
// 1,0
case 0:
ReturnList.push_back(m_BoardSwap(i,j,0,0));
ReturnList.push_back(m_BoardSwap(i,j,1,1));
ReturnList.push_back(m_BoardSwap(i,j,2,0));
break;
// 1,1
case 1:
ReturnList.push_back(m_BoardSwap(i,j,0,1));
ReturnList.push_back(m_BoardSwap(i,j,1,0));
ReturnList.push_back(m_BoardSwap(i,j,1,2));
ReturnList.push_back(m_BoardSwap(i,j,2,1));
break;
// 1,2
case 2:
ReturnList.push_back(m_BoardSwap(i,j,0,2));
ReturnList.push_back(m_BoardSwap(i,j,1,1));
ReturnList.push_back(m_BoardSwap(i,j,2,2));
break;
}
break;
case 2:
switch(j)
{
// 2,0
case 0:
ReturnList.push_back(m_BoardSwap(i,j,1,0));
ReturnList.push_back(m_BoardSwap(i,j,2,1));
break;
// 2,1
case 1:
ReturnList.push_back(m_BoardSwap(i,j,2,0));
ReturnList.push_back(m_BoardSwap(i,j,1,1));
ReturnList.push_back(m_BoardSwap(i,j,2,2));
break;
// 2,2
case 2:
ReturnList.push_back(m_BoardSwap(i,j,2,1));
ReturnList.push_back(m_BoardSwap(i,j,1,2));
break;
}
break;
}
}
return ReturnList;
}
//####################################
// Function : PrintGoal
// Purpose : Function used to pretty
// up interface and give
// a visual representation
// of what was started
// and what was ended
//####################################
void Board_Tile::PrintGoal(Board_Tile Goal) const
{
std::cout << "\n"
<< " " << board[0][0] << " " << board[0][1] << " " << board[0][2]
<< " " << Goal.board[0][0] << " " << Goal.board[0][1] << " " << Goal.board[0][2] << "\n"
<< " " << board[1][0] << " " << board[1][1] << " " << board[1][2]
<< " -> " << Goal.board[1][0] << " " << Goal.board[1][1] << " " << Goal.board[1][2] << "\n"
<< " " << board[2][0] << " " << board[2][1] << " " << board[2][2]
<< " " << Goal.board[2][0] << " " << Goal.board[2][1] << " " << Goal.board[2][2] << "\n\n";
}
//####################################
// Function : numMoves
// Purpose : returns the length of
// Moves_From_Start, which
// is the number of moves
// to get from start->end
//####################################
int Board_Tile::numMoves() const
{
return Moves_From_Start.length();
}
//####################################
// Function : Solution
// Purpose : Returns The Moves_From_Start
// variable, which is the
// order of moves U/D/R/L
//####################################
std::string Board_Tile::Solution() const
{
return Moves_From_Start;
}
//####################################
// Function : config
// Purpose : Does an Error Check, Then
// Converts the string of
// characters to be integers
// in the Board
//####################################
void Board_Tile::config(std::string inConfig)
{
inConfig = m_errorCheck(inConfig);
int cur = 0;
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
{
board[i][j] = m_CharToInt(inConfig[cur]);
cur++;
}
}
//#########################//
// //
// Public Member Operators //
// //
//#########################//
//####################################
// Function : == Operator
// Purpose : Compares ONLY the
// Boards of two Board_Tile
// objects
//####################################
bool Board_Tile::operator == (Board_Tile inBoard) const
{
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
if(board[i][j] != inBoard.board[i][j])
return false;
return true;
}
//####################################
// Function : > Operator
// Purpose : Compares Manhatton
// Distances of Two Boards
// (Essential for pq)
//####################################
bool Board_Tile::operator > (Board_Tile inBoard) const
{
return MD > inBoard.MD;
}
//####################################
// Function : = Operator
// Purpose : Sents a Board to
// be another
//####################################
void Board_Tile::operator = (Board_Tile inBoard)
{
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
board[i][j] = inBoard.board[i][j];
MD = inBoard.MD;
Moves_From_Start = inBoard.Moves_From_Start;
}
//##########################//
// //
// Private Member Functions //
// //
//##########################//
//####################################
// Function : m_errorCheck
// Purpose : Private function to
// check if input is propper
// (Doesn't check dublicates)
//####################################
std::string Board_Tile::m_errorCheck(std::string inString)
{
if(inString.length() == 9)
{
for(int i = 0; i < inString.length(); i++)
{
if(!(m_CharToInt(inString[i]) <= 8 && m_CharToInt(inString[i]) >= 0))
{
std::cout << "\n"
<< "Invalid Configuration : Illegal Character '"
<< inString[i] << "' Not Allowed!!\n"
<< "Please Try Again . . .\n"
<< "\n Enter a Configuration to be Solved . . .\n"
<< " Ex. '123456780'\n\n Config : ";
std::string newString;
std::cin >> newString;
return m_errorCheck(newString);
break;
}
}
return inString;
}
else
{
std::cout << "\n"
<< "Invalid Configuration : Improper Number of Characters!!\n"
<< "Please Try Again . . .\n"
<< "\n Enter a Configuration to be Solved . . .\n"
<< " Ex. '123456780'\n\n Config : ";
std::string newString;
std::cin >> newString;
return m_errorCheck(newString);
}
}
//####################################
// Function : m_CharToInt
// Purpose : Private Function to turn
// a char into an int
//####################################
int Board_Tile::m_CharToInt(char C)
{
return C-'0';
}
//####################################
// Function : m_BoardSwap
// Purpose : Private Function to help
// facilitate the swapping
// if tile locations.
// Also Appends the Move
//####################################
Board_Tile Board_Tile::m_BoardSwap(int a, int b, int c, int d)
{
Board_Tile ReturnBoard = *this;
// swap the two tiles
int temp;
temp = ReturnBoard.board[a][b];
ReturnBoard.board[a][b] = ReturnBoard.board[c][d];
ReturnBoard.board[c][d] = temp;
// Add the Move that was Made
if(a > c) {ReturnBoard.Moves_From_Start += "U";}
else if(c > a){ReturnBoard.Moves_From_Start += "D";}
else if(b > d){ReturnBoard.Moves_From_Start += "L";}
else if(d > b){ReturnBoard.Moves_From_Start += "R";}
return ReturnBoard;
}
//####################################
// Function : << Operator
// Purpose : Allow the priting
// of Board_Tile Objects
//####################################
std::ostream& operator << (std::ostream& out, Board_Tile outBoard)
{
for(int i = 0; i < 3; i++)
for(int j = 0; j < 3; j++)
out << outBoard.board[i][j];
}