-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueens.c
140 lines (121 loc) · 3.19 KB
/
queens.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
#define N 8
#define COLOR_BGW "\x1b[47m"
#define COLOR_BGB "\x1b[100m"
#define COLOR_BLK "\x1b[30m"
#define COLOR_RESET "\x1b[0m"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
typedef enum {false,true} bool;
void continuar() {
printf("\n Pressione [Enter] para outra solucao.");
while (getchar() !='\n');
}
void wait(unsigned int secs) { // Espera X segundos
unsigned int retTime = time(0) + secs; // Get finishing time.
while (time(0) < retTime); // Loop until it arrives.
}
int color(int i, int j) {
return (i+j)%2;
}
int countSLT() {
static int k = 0;
return k++;
}
void printBoard(int board[N][N], int delay) {
system("clear");
int i,j;
if (delay) printf("\n N-QUEENS (delay=1s)\n\n");
else printf("\n N-QUEENS\n\n");
for (i=0; i<N; i++) {
printf(" %d ", i+1);
for (j=0; j<N; j++)
if (!color(i,j)) {
if (board[i][j])
printf(COLOR_BGW COLOR_BLK " \u265B " COLOR_RESET);
else
printf(COLOR_BGW " " COLOR_RESET);
}
else {
if (board[i][j])
printf(COLOR_BGB COLOR_BLK " \u265B " COLOR_RESET);
else
printf(COLOR_BGB " " COLOR_RESET);
}
printf("\n");
}
printf(" ");
for (i=0; i<N; i++) {
printf(" %c ", i+97);
}
if (delay) printf("\n\n Processando...\n (ctrl+c para abortar)\n");
else printf("\n");
}
bool valida(int board[N][N], int row, int col) {
int i,j;
for (i=0; i<col; i++)
if (board[row][i])
return false;
for (i=row,j=col; i>=0 && j>=0; i--,j--)
if (board[i][j])
return false;
for (i=row, j=col; j>=0 && i<N; i++,j--)
if (board[i][j])
return false;
return true;
}
/* bool solve(int board[N][N], int col) {
int i;
if (col>=N) return true;
for (i=0; i<N; i++) {
if (valida(board,i,col)) {
board[i][col] = 1;
if (solve(board,col+1))
return true;
board[i][col] = 0;
}
}
return false;
} */
bool solve(int board[N][N], int col, int delay) {
int i;
bool solucao = false;
if (col == N) {
printBoard(board,delay);
printf("\n Solucao: %d", countSLT());
continuar();
return true;
}
for (i=0; i<N; i++) {
if (valida(board,i,col)) {
board[i][col] = 1;
printBoard(board,delay);
if (delay) wait(1);
solucao = solve(board,col+1,delay) || solucao;
board[i][col] = 0;
printBoard(board,delay);
if (delay) wait(1);
}
}
return solucao;
}
void callNQ() {
system("clear");
int board[N][N];
bool delay = false;
char ask;
memset(board,0,sizeof(board));
printf("\n Usar o delay para visualizar o backtracking? [s/n]");
ask = getchar();
if (ask == 's') delay = true;
if (!solve(board,0,delay)) {
printf("Nao existe uma solucao.\n");
return;
}
return;
}
int main(void) {
callNQ();
return 0;
}