-
Notifications
You must be signed in to change notification settings - Fork 0
/
solve_fillit.c
144 lines (134 loc) · 3.08 KB
/
solve_fillit.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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* solve_fillit.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: aquint <aquint@42.us.org> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2017/08/24 00:16:17 by aquint #+# #+# */
/* Updated: 2017/09/06 00:41:15 by aquint ### ########.fr */
/* */
/* ************************************************************************** */
#include "./libft/libft.h"
#include "fillit.h"
#define TRUE 1
#define FALSE 0
int r_fillit_solver(char **board, t_piece *head, int row, int col)
{
if (head->content == NULL)
{
head->head->end = 1;
return (TRUE);
}
if (board[row] == '\0')
head->head->end = 0;
else if ((valid_check(board, head->content, row, col)) == FALSE)
{
if (board[row][col] == '\0')
r_fillit_solver(board, head, row + 1, 0);
else
r_fillit_solver(board, head, row, col + 1);
}
else
{
place_piece(board, head->content, row, col);
r_fillit_solver(board, head->next, 0, 0);
if (head->head->end != 1)
delete_piece(board, head, row, col);
if (head->head->end == 1)
return (TRUE);
}
return (FALSE);
}
int valid_check(char **board, char **piece, size_t row, size_t col)
{
size_t i;
size_t c;
i = 0;
c = 0;
while (piece[i] != '\0')
{
c = 0;
while (piece[i][c] != '\0')
{
if (piece[i][c] != '.')
{
if (((col + c) >= (ft_strlen(board[row]))) ||
((row + i) >= (ft_strlen(board[row]))))
return (FALSE);
if (!(board[row + i][col + c] == '.'))
return (FALSE);
}
c++;
}
i++;
}
return (TRUE);
}
char **place_piece(char **board, char **piece, int row, int col)
{
int i;
int c;
i = 0;
while (piece[i])
{
c = 0;
while (piece[i][c])
{
if (piece[i][c] != '.')
{
if (board[row + i][col + c] == '.')
{
board[row + i][col + c] = piece[i][c];
}
}
c++;
}
i++;
}
return (board);
}
char **delete_piece(char **board, t_piece *head, int row, int col)
{
int i;
int c;
char ch;
i = 0;
ch = (head->number) + 64;
while (board[i] != '\0')
{
c = 0;
while (board[i][c] != '\0')
{
if (board[i][c] == ch)
board[i][c] = '.';
c++;
}
i++;
}
r_fillit_solver(board, head, row, col + 1);
return (board);
}
char **fillit_board(int size)
{
char **board;
int i;
int col;
i = 0;
if (!(board = (char**)ft_memalloc(sizeof(*board) * (size + 1))))
return (NULL);
bzero(board, size + 1);
while (i < size)
{
if (!(board[i] = (char*)ft_memalloc(sizeof(board) * (size + 1))))
return (NULL);
bzero(board[i], size + 1);
col = 0;
while (col < size)
board[i][col++] = '.';
board[i][col] = '\0';
i++;
}
board[i] = NULL;
return (board);
}