/* This program finds the arrangement for the maximum no. of queens that can be put in a n*n chess board such that no queen attacks any other queen. ENTER THE SIZE OF CHESSBOARD Example - 6 */ #include using namespace std; //After we put a queen, this will increase the value of chess board cells where queen is attacking by 1 and later the print function will set the value 1 to chess board wherever any queen is attacking void set1(int **cb,int i,int j,int n) { int a=i+1; while(a=0) { cb[a][j]=cb[a][j]+1; a--; } int b=j+1; while(b=0) { cb[i][b]=cb[i][b]+1; b--; } a=i+1;b=j+1; while(a=0 && b>=0) { cb[a][b]=cb[a][b]+1; a--;b--; } a=i+1;b=j-1; while(a=0) { cb[a][b]=cb[a][b]+1; a++;b--; } a=i-1;b=j+1; while(a>=0 && b1&&cb[i][j]<9) cb[i][j]=1; cout<=0) { cb[a][j]--; a--; } int b=j+1; while(b=0) { cb[i][b]--; b--; } a=i+1;b=j+1; while(a=0 && b>=0) { cb[a][b]--; a--;b--; } a=i+1;b=j-1; while(a=0) { cb[a][b]--; a++;b--; } a=i-1;b=j+1; while(a>=0 && b=1) { j++; while(j>=n) { i--; j=0; while(cb[i][j]!=9){ j++; } removequeen(cb,i,j,n); j++; } } } } int main() { int n; cin>>n; // to create chess board cb which is 2D array and can be passed to a function by reference int **cb; cb=new int*[n]; int i; for(i=0;i

N queens problem