-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_resolve.c
125 lines (114 loc) · 2.76 KB
/
ft_resolve.c
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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_resolve.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mgessa <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/11/28 23:48:36 by mgessa #+# #+# */
/* Updated: 2018/12/02 23:32:12 by mgessa ### ########.fr */
/* */
/* ************************************************************************** */
#include "fillit.h"
int remove_bl(t_tetris *tet, t_map *map, int cords[2], int el_todel)
{
int i;
t_block block;
i = 0;
if (el_todel <= 0)
return (1);
while (i < el_todel)
{
block = tet->blocks[i];
map->map[cords[0] + block.y][cords[1] + block.x] = 0;
++i;
}
return (1);
}
int can_place(t_tetris *tet, t_map *map, int cords[2], int bl_index)
{
int i;
t_block block;
i = -1;
while (++i < 4)
{
block = tet->blocks[i];
if (cords[0] + block.y < map->sz && cords[1] + block.x >= 0
&& cords[1] + block.x < map->sz)
{
if (map->map[cords[0] + block.y][cords[1] + block.x] == 0)
map->map[cords[0] + block.y][cords[1] + block.x] = bl_index;
else
{
remove_bl(tet, map, cords, i);
return (0);
}
}
else
{
remove_bl(tet, map, cords, i);
return (0);
}
}
return (1);
}
int is_available(t_map *map)
{
int i;
i = 0;
while (i < map->nb_pcs)
{
if (map->t_pcs[i]->used == 0)
return (1);
++i;
}
return (0);
}
int ft_solve(t_map *map, int **tab, int sz, int i)
{
int x;
int cords[2];
i = 0;
if (is_available(map) == 0)
return (1);
while (map->t_pcs[i]->used == 1)
i++;
x = -1;
while (++x < sz * sz && map->t_pcs[i]->used == 0)
{
cords[0] = x / sz;
cords[1] = x % sz;
if (can_place(map->t_pcs[i], map, cords, i + 1) == 1)
{
map->t_pcs[i]->used = 1;
if (ft_solve(map, tab, sz, 0) == 1)
return (1);
remove_bl(map->t_pcs[i], map, cords, 4);
map->t_pcs[i]->used = 0;
}
}
return (0);
}
int ft_resolve(t_map *map)
{
int size;
int **tab;
int result;
size = ft_perfect_square(map->nb_pcs * 4);
result = 0;
while (result != 1)
{
if (!(tab = ft_create_array(size)))
return (-1);
map->sz = size;
map->map = tab;
result = ft_solve(map, tab, size, 0);
if (result == 0)
free_int_tab(tab, size);
if (result == 0)
++size;
}
ft_show_tab(size, tab);
free_int_tab(tab, size);
return (1);
}