-
Notifications
You must be signed in to change notification settings - Fork 0
/
puzzle.h
80 lines (53 loc) · 1.58 KB
/
puzzle.h
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
#include <string>
#include <iostream>
using namespace std;
enum heuristicFunction{misplacedTiles, manhattanDistance};
class Puzzle{
private:
string path;
int pathLength;
int hCost;
int fCost;
int depth;
int goalBoard[3][3];
int x0, y0; //coordinates of the blank or 0-tile
int board[3][3];
public:
string strBoard;
Puzzle(const Puzzle &p); //Constructor
Puzzle(string const elements, string const goal);
void printBoard();
int h(heuristicFunction hFunction);
void updateFCost();
void updateHCost(heuristicFunction hFunction);
void updateDepth(){
depth++;
}
bool goalMatch();
string toString();
string getString(){
return strBoard;
}
bool canMoveLeft();
bool canMoveRight();
bool canMoveUp();
bool canMoveDown();
//----------------------------------------
//these functions will be useful for Progressive Deepening Search
bool canMoveLeft(int maxDepth);
bool canMoveDown(int maxDepth);
bool canMoveRight(int maxDepth);
bool canMoveUp(int maxDepth);
//----------------------------------------
Puzzle * moveUp();
Puzzle * moveRight();
Puzzle * moveDown();
Puzzle * moveLeft();
const string getPath();
void setDepth(int d);
int getDepth();
int getPathLength();
int getFCost();
int getHCost();
int getGCost();
};