-
Notifications
You must be signed in to change notification settings - Fork 0
/
t12.c
66 lines (60 loc) · 789 Bytes
/
t12.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
//N-Queens
#include<stdio.h>
void printsol(int a[],int n)
{
char c[10][10];
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
c[i][j]='X';
for(i=1;i<=n;i++)
c[i][a[i]]='Q';
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%c\t",c[i][j]);
printf("\n");
}
}
int place(int a[],int k)
{
int i;
for(i=1;i<k;i++)
if((a[i]==a[k])||(abs(a[i]-a[k])==abs(i-k)))
return 0;
return 1;
}
void nqueen(int n)
{
int k=1,count=0,a[10];
a[k]=0;
while(k!=0)
{
a[k]++;
while(a[k]<=n && !place(a,k))
a[k]++;
if(a[k]<=n)
{
if(k==n)
{
printf("\nSolution %d\n",++count);
printsol(a,n);
}
else
{
k++;
a[k]=0;
}
}
else
k--;
}
}
void main()
{
int n;
printf("\nEnter No. of Queens: ");
scanf("%d",&n);
nqueen(n);
printf("\n");
}