#include <stdio.h>
#include <stdlib.h>
#include <math.h><\/p>\n
void queens(int i);
bool promising(int i);<\/p>\n
int n;
int *col;<\/p>\n
int main()
{<\/p>\n
printf(“Insert Number…n”);
printf(“Insert : “);
scanf(“%d”, &n);<\/p>\n
col = (int *)malloc(n * sizeof(int));
queens(0);<\/p>\n
return 0;
}<\/p>\n
void queens(int i)
{
int j, tmp;<\/p>\n
if(promising(i))
if(i == N) {
for(tmp = 1; tmp <= N; tmp++)
printf(“%d “, col[tmp]);
printf(“n”);
}
else
for(j = 1; j <= N; j++) {
col[i + 1] = j;
queens(i + 1);
}
}<\/p>\n
bool promising(int i)
{
int k;
bool result;<\/p>\n
k = 1;
result = true;<\/p>\n
while(k < i && result) {
if(col[i] == col[k] || abs(col[i] – col[k]) == i – k)
result = false;
k++;
}
return result;
}<\/p>\n","protected":false},"excerpt":{"rendered":"
#include <stdio.h>#include <stdlib.h>#include <math.h> void queens(int i);bool promising(int i); int n;int *col; int main(){ printf(“Insert Number…n”); printf(“Insert : “); scanf(“%d”, &n); col = (int *)malloc(n * sizeof(int)); queens(0); return 0;} void queens(int i){ int j, tmp; if(promising(i)) if(i == N) { for(tmp = 1; … Continue reading