Data-structures/N_queens_Backtracking_cpp at master · k-samarth/Data-structures · GitHub

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
#include <iostream>
using namespace std;
bool check(int queen[][10],int i,int j,int n)
{
     int m=i;
    while(m>=0)
    {
        if(queen[m][j]==1)
           return false;
        m--;
    }
    int k=i;
    int l=j;
    while(k >=0 && l>=0)
    {
        if(queen[k][l]==1)
           return false;
        k--;
        l--;
    }
    k=i;
    l=j;
    while(k>=0&& l<n)
    {
        if(queen[k][l]==1)
           return false;
        k--;
        l++;
    }
return true;
}
bool queenAllocator(int queen[][10],int i,int n)
{
     if(i==n)
    {

       for(int i=0;i<n;i++){
          for(int j=0;j<n;j++){
             if(queen[i][j]==1)
               cout<<"Q ";
             else
               cout<<"_ ";
          }
          cout<<endl;}
          cout<<endl<<endl;
    return false;
    }
    for(int j=0;j<n;j++)
    {
     if(check(queen,i,j,n)){
        queen[i][j]=1;

     if(queenAllocator(queen,i+1,n))
        return true;

     queen[i][j]=0;

    }
}
return false;
}
int main()
{  int n;
    cin>>n;
    int queen[10][10]={0};
    cout<<queenAllocator(queen,0,n)<<endl;

    return 0;
}