-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
470 lines (411 loc) · 16.9 KB
/
main.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
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
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
#include <SFML/Graphics.hpp>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <math.h>
#define WIDTH 900
#define HEIGTH 900
#define GRIDSIZE 16
#define CELLSIZE 9
int random(int min, int max)
{
return rand() % (max - min + 1) + min;
}
class cell
{
public:
sf::Vector2f pos;
int nPossib = 16;
int id;
std::array<int, 16> possibId = {1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15, -1};
std::array<int, 16> possibleCellsUp;
std::array<int, 16> possibleCellsDown;
std::array<int, 16> possibleCellsLeft;
std::array<int, 16> possibleCellsRight;
//variable to store path to image
std::string imgPath;
cell()
{
pos.x = 0;
pos.y = 0;
};
};
void drawGrid(sf::RenderWindow &window, cell grid[GRIDSIZE][GRIDSIZE])
{
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
//display img
sf::Sprite sprite;
sf::Texture texture;
texture.loadFromFile(grid[i][j].imgPath);
sprite.setTexture(texture);
sprite.setPosition(grid[i][j].pos);
window.draw(sprite);
//print npossib of each cell
//std::cout << std::setw(2) << grid[i][j].nPossib << " ";
}
//std::cout << std::endl;
}
//std::cout << std::endl;
}
void printGridId(cell grid[GRIDSIZE][GRIDSIZE])
{
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
std::cout << std::setw(2) << grid[i][j].id << " ";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
void printGridNpossib(cell grid[GRIDSIZE][GRIDSIZE])
{
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
std::cout << std::setw(2) << grid[j][i].nPossib << " ";
}
std::cout << std::endl;
}
std::cout << std::endl;
}
int lowestNPossib (cell grid[GRIDSIZE][GRIDSIZE])
{
int min = 16;
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
if (grid[i][j].nPossib < min && grid[i][j].nPossib != 0)
{
min = grid[i][j].nPossib;
}
}
}
return min;
}
sf::Vector2i randomLowestCell (cell grid[GRIDSIZE][GRIDSIZE])
{
sf::Vector2i pos;
int min = lowestNPossib(grid);
int n = 0;
//*Aleatoriza uma celula qualquer, mas se ela não for uma das com menor nPossib, ele aleatoriza de novo
while (n != min)
{
pos.x = random(0, GRIDSIZE - 1);
pos.y = random(0, GRIDSIZE - 1);
n = grid[pos.x][pos.y].nPossib;
}
return pos;
}
void changeCellId(cell grid[GRIDSIZE][GRIDSIZE], sf::Vector2i pos, int id)
{
grid[pos.x][pos.y].id = id;
grid[pos.x][pos.y].imgPath = "img/" + std::to_string(id) + ".png";
/*baixo vazio = 0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1
esquerda vazio = 0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1
direita vazio = 0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1
cima vazio = 0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1
baixo preenchido = 1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1
esquerda preenchido = 2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1
direita preenchido = 4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1
cima preenchido = 3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1
*/
switch (id)
{
case 0:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0,2,3,4,8,9,10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0,1,3,4,6,7,10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0,1,2,3,5,6,8,11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0,1,2,4,5,7,9,12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 1:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0,2,3,4,8,9,10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0,1,3,4,6,7,10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0,1,2,3,5,6,8,11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3,6,8,10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 2:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 3:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 4:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 5:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 6:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 7:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 8:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 9:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 10:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 11:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {0, 1, 3, 4, 6, 7, 10,13,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 12:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {0, 2, 3, 4, 8, 9, 10,14,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 13:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {0, 1, 2, 3, 5, 6, 8, 11,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 14:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {0, 1, 2, 4, 5, 7, 9, 12,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 15:
grid[pos.x][pos.y].nPossib = 0;
grid[pos.x][pos.y].possibleCellsDown = {1, 5, 6, 7, 11,12,13,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsLeft = {2, 5, 8, 9, 11,12,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsRight = {4, 7, 9, 10,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
grid[pos.x][pos.y].possibleCellsUp = {3, 6, 8, 10,11,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1};
break;
case 16:
grid[pos.x][pos.y].possibleCellsDown = {1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15, -1};
grid[pos.x][pos.y].possibleCellsLeft = {1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15, -1};
grid[pos.x][pos.y].possibleCellsRight = {1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15, -1};
grid[pos.x][pos.y].possibleCellsUp = {1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15, -1};
break;
}
}
void atualizaNPossib(cell grid[GRIDSIZE][GRIDSIZE])
{
for (int x = 0; x < GRIDSIZE; x++)
{
for (int y = 0; y < GRIDSIZE; y++)
{
//*checa se a celula de CIMA existe
if (y - 1 >= 0 && grid[x][y].id == 16)
{
for (int i = 0; i < 16; i++)
{
int existe = 0;
for (int j = 0; j < 16; j++)
{
if (grid[x][y - 1].possibleCellsDown[j] == grid[x][y].possibId[i])
{
existe = 1;
}
}
if (existe == 0)
{
grid[x][y].possibId[i] = -1;
}
}
}
//*checa se a celula de BAIXO existe
if (y + 1 < GRIDSIZE && grid[x][y].id == 16)
{
for (int i = 0; i < 16; i++)
{
int existe = 0;
for (int j = 0; j < 16; j++)
{
if (grid[x][y + 1].possibleCellsUp[j] == grid[x][y].possibId[i])
{
existe = 1;
}
}
if (existe == 0)
{
grid[x][y].possibId[i] = -1;
}
}
}
//*checa se a celula da ESQUERDA existe
if (x - 1 >= 0 && grid[x][y].id == 16)
{
for (int i = 0; i < 16; i++)
{
int existe = 0;
for (int j = 0; j < 16; j++)
{
if (grid[x - 1][y].possibleCellsRight[j] == grid[x][y].possibId[i])
{
existe = 1;
}
}
if (existe == 0)
{
grid[x][y].possibId[i] = -1;
}
}
}
//*checa se a celula da DIREITA existe
if (x + 1 < GRIDSIZE && grid[x][y].id == 16)
{
for (int i = 0; i < 16; i++)
{
int existe = 0;
for (int j = 0; j < 16; j++)
{
if (grid[x + 1][y].possibleCellsLeft[j] == grid[x][y].possibId[i])
{
existe = 1;
}
}
if (existe == 0)
{
grid[x][y].possibId[i] = -1;
}
}
}
//! atualiza o nPossib
int difID = 0;
for (int ID = 0; ID < 16; ID++)
{
if (grid[x][y].possibId[ID] != -1 && grid[x][y].id == 16)
{
difID++;
}
}
grid[x][y].nPossib = difID;
}
}
}
int main()
{
//*tela e view
sf::RenderWindow window(sf::VideoMode(WIDTH, HEIGTH), "SFML!", sf::Style::Close | sf::Style::Titlebar);
sf::View view(sf::Vector2f(GRIDSIZE * CELLSIZE / 2, GRIDSIZE * CELLSIZE / 2), sf::Vector2f(GRIDSIZE * CELLSIZE, GRIDSIZE * CELLSIZE));
window.setView(view);
//*cria a grid e aleatoriza uma celula para começar o algoritmo
cell grid[GRIDSIZE][GRIDSIZE];
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
grid[i][j].pos.x = i * (CELLSIZE + 0);//? 0 é o espaçamento entre as celulas
grid[i][j].pos.y = j * (CELLSIZE + 0);
changeCellId(grid, sf::Vector2i(i, j), 16);
}
}
// sf::Vector2i pos = randomLowestCell(grid);
sf::Vector2i pos = sf::Vector2i(4, 5);
changeCellId(grid, pos, random(1, 15));
atualizaNPossib(grid);
while (window.isOpen())//! cada iteração aqui é um frame
{
sf::Event evnt;
while (window.pollEvent(evnt))
{
switch (evnt.type)
{
case sf::Event::Closed:
window.close();
break;
}
}
//!codigo a ser executado todo frame
//* appl 500ms delay
//checks if there is any cell with id == 16
int n16 = 0;
for (int i = 0; i < GRIDSIZE; i++)
{
for (int j = 0; j < GRIDSIZE; j++)
{
if (grid[i][j].id == 16)
{
n16++;
i = GRIDSIZE;
j = GRIDSIZE;
}
}
}
if (n16 == 1)
{
sf::sleep(sf::milliseconds(125));
sf::Vector2i posLowest = randomLowestCell(grid);
//changes the lowest cell to a random id in its possibId
int changed = 0;
while(changed == 0)
{
int id = random(0, 15);
if (grid[posLowest.x][posLowest.y].possibId[id] != -1)
{
changeCellId(grid, posLowest, grid[posLowest.x][posLowest.y].possibId[id]);
changed = 1;
}
}
atualizaNPossib(grid);
}
//*clear the screen
window.clear();
//? render something on the screen
//*draw the grid
drawGrid(window, grid);
//? refresh the screen applying the changes
window.display();
}
return 0;
}