-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathplay.cpp
More file actions
249 lines (232 loc) · 5.61 KB
/
play.cpp
File metadata and controls
249 lines (232 loc) · 5.61 KB
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
#include<stdlib.h>
#include<time.h>
using namespace std;
#include <assert.h>
// -------------------------------------------------------------------------------------
// static functions
static int getDimensionBySize(int size) {
switch (size) {
case 9:
return 3;
case 16:
return 4;
case 25:
return 5;
default:
assert(!"Invalide size.");
return 4;
}
}
static int getSizeByDimension(int dim) {
assert(dim > 2 && dim < 6);
return dim * dim;
}
static void swapTiles(int * puzzle, int ix1, int ix2) {
assert(puzzle != nullptr);
assert(ix1 >= 0 && ix2 >= 0);
int tmp = puzzle[ix1];
puzzle[ix1] = puzzle[ix2];
puzzle[ix2] = tmp;
}
// -------------------------------------------------------------------------------------
void moveSlide(int* tempPuzzle, int n, int slider)
{
int temp = *(tempPuzzle + n);
*(tempPuzzle + n) = *(tempPuzzle + slider);
*(tempPuzzle + slider) = temp;
}
int checkSlider(int* tempPuzzle, int size)
{
for (int i = 0; i < size; i++)
{
if (*(tempPuzzle + i) == 0)
return i;
}
assert(!"Failed to check slider");
return -1;
}
int operate(int* tempPuzzle, int move, int size)
{
if(size==9)
{
int slider = checkSlider(tempPuzzle, size);
if (slider - move == 1 || slider - move == -1 || slider - move == 3 || slider - move == -3)
{
moveSlide(tempPuzzle, move, slider);
return 1;
}
else
return 0;
}
if(size==16)
{
int slider = checkSlider(tempPuzzle, size);
if (slider - move == 1 || slider - move == -1 || slider - move == 4 || slider - move == -4)
{
moveSlide(tempPuzzle, move, slider);
return 1;
}
else
return 0;
}
return 0;
}
void setNum(int* tempPuzzle, int choice)
{
int* b = new int[choice];
int n = 0;
for (int i = 0; i < 9; i++)
{
int count = 0;
for (int j = 0; j < 9; j++)
{
if (tempPuzzle[j] == i)
count = 1;
}
if (count == 0)
{
b[n] = i;
n++;
}
}
int randSeed = rand() % choice;
*(tempPuzzle + 9 - choice) = b[randSeed];
delete[] b;
}
bool Up(int tempPuzzle[],int slider, int size)
{
int dim = getDimensionBySize(size);
for (int i = 0; i < size; i++) {
if (tempPuzzle[i] == slider) {
if (i - dim < 0)
return false;
swapTiles(tempPuzzle, i, i - dim);
return true;
}
}
return false;
}
bool Down(int tempPuzzle[], int slider, int size)
{
int dim = getDimensionBySize(size);
for (int i = 0; i < size; i++) {
if (tempPuzzle[i] != slider)
continue;
if (i + dim > size - 1)
return false;
swapTiles(tempPuzzle, i, i + dim);
}
return false;
}
bool Left(int tempPuzzle[], int slider, int size)
{
int dim = getDimensionBySize(size);
for (int i = 0; i < size; i++) {
if (tempPuzzle[i] != slider)
continue;;
if (i % dim == 0)
return false;
swapTiles(tempPuzzle, i, i - 1);
}
return false;
}
bool Right(int tempPuzzle[], int slider, int size)
{
int dim = getDimensionBySize(size);
for (int i = 0; i < size; i++) {
if (tempPuzzle[i] != slider)
continue;
if ((i+1) % dim == 0)
return false;
swapTiles(tempPuzzle, i, i+1);
}
return false;
}
int* initializePuzzle(int tempPuzzle[], int depth, int size)
{
int count = 0;
srand((unsigned)time(NULL));
while (count<depth)
{
int s=0;
int seed = rand() % 4;
if (seed == 0)
if (Up(tempPuzzle, s, size) == 1)
{
count++;
}
if (seed == 1)
if (Down(tempPuzzle, s, size) == 1)
{
count++;
}
if (seed == 2)
if (Left(tempPuzzle, s, size) == 1)
{
count++;
}
if (seed == 3)
if (Right(tempPuzzle, s, size) == 1)
{
count++;
}
}
return tempPuzzle;
}
bool checkComplete(int* tempPuzzle, int size)
{
for(int i=0;i<size-1;i++)
{
if(*(tempPuzzle+i)!=i+1)
return false;
}
return true;
}
void up(int* tempPuzzle,int dim)
{
int i=0;
while(*(tempPuzzle+i)!=0)
i++;
int temp=*(tempPuzzle+i);
*(tempPuzzle+i)=*(tempPuzzle+i-dim);
*(tempPuzzle+i-dim)=temp;
}
void down(int* tempPuzzle,int dim)
{
int i=0;
while(*(tempPuzzle+i)!=0)
i++;
int temp=*(tempPuzzle+i);
*(tempPuzzle+i)=*(tempPuzzle+i+dim);
*(tempPuzzle+i+dim)=temp;
}
void left(int* tempPuzzle,int dim)
{
int i=0;
while(*(tempPuzzle+i)!=0)
i++;
int temp=*(tempPuzzle+i);
*(tempPuzzle+i)=*(tempPuzzle+i-1);
*(tempPuzzle+i-1)=temp;
}
void right(int* tempPuzzle,int dim)
{
int i=0;
while(*(tempPuzzle+i)!=0)
i++;
int temp=*(tempPuzzle+i);
*(tempPuzzle+i)=*(tempPuzzle+i+1);
*(tempPuzzle+i+1)=temp;
}
void showStep(int* tempPuzzle,int step, int& i, int dim)
{
if(step==1)
up(tempPuzzle,dim);
if(step==2)
down(tempPuzzle,dim);
if(step==3)
left(tempPuzzle,dim);
if(step==4)
right(tempPuzzle,dim);
i++;
}