blob: ba2c7420e7515409e46938a5c9d5b37111cc3a91 (
plain)
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
|
#include <unistd.h>
#define TRUE 1
#define FALSE 0
#define BOARD_SIZE 10
#define ABS(x) (x < 0 ? -(x) : x)
void ft_putchar(char c)
{
write(1, &c, 1);
}
static void print_cols(int cols[BOARD_SIZE])
{
int i;
i = 0;
while (i < BOARD_SIZE)
ft_putchar(cols[i++] + '0'); // maybe +1
ft_putchar('\n');
}
static int valid_position(int cols[BOARD_SIZE], int x, int y)
{
int i;
i = 0;
while (i < x)
{
if (y == cols[i])
return (FALSE);
if (ABS(x - i) == ABS(y - cols[i]))
return (FALSE);
i++;
}
return (TRUE);
}
static void solve(int cols[BOARD_SIZE], int x)
{
int i;
if (x == BOARD_SIZE)
{
print_cols(cols);
return ;
}
i = -1;
while (++i < BOARD_SIZE)
{
if (!valid_position(cols, x, i))
continue ;
cols[x] = i;
solve(cols, x + 1);
}
}
void ft_queens(void) // may have bad name
{
int cols[BOARD_SIZE];
solve(cols, 0);
}
|