/* This code shows a 8*8 chess table and add 8 Queens in it that none of queens don't collide others'*/ /*Please run this code on the web if you have undrestading output problem*/ #include #include #include #include using namespace std; void porKon(int a[][8],int x,int y); void haalat(int a[][8]); void chaapKon(int a[][8]); int isCorrect(int a[][8]); int main() { srand(time(0)); int board[8][8]={0}; int n=0; while (!isCorrect (board)) { for (int i=0;i<8;i++) for (int j=0;j<8;j++) board[i][j]=0; haalat(board); } chaapKon(board); cin >> n; return 0; } void porKon(int a[][8],int x,int y) { a[x][y]=2; for (int i=0;i<8;i++) if (a[i][y]==0) a[i][y]=1; for (int j=0;j<8;j++) if (a[x][j]==0) a[x][j]=1; if (x<7 && y<7) for (int g=x+1 , h=y+1;g<8 , h<8;g++ , h++) if (a[g][h]==0) a[g][h]=1; if (x>0 && y>0) for (int k=x-1 , l=y-1;k>=0 , l>=0;k-- , l--) if (a[k][l]==0) a[k][l]=1; if (x>0 && y<7) for (int m=x-1 , n=y+1;m>=0 , n<8;m-- , n++) if (a[m][n]==0) a[m][n]=1; if (x<7 && y>0) for (int p=x+1 , q=y-1;p<8 , q>=0;p++ , q--) if (a[p][q]==0) a[p][q]=1; } void haalat(int a[][8]) { int H[8]={0}; int flag=1; int count1=0; int count64=0; int i,j; while(flag) { i=rand()/100%8; j=rand()/100%8; if (i<8 && i>=0 && j<8 && j>=0) { count64=0; for (int x=0;x<8;x++) { count1=0; for (int y=0;y<8;y++) if (a[x][y]!=0) { count1++; count64++; } if (count1==8) H[x]=1; } if (count64==64) flag=0; if (a[i][j]==0) { H[i]=1; porKon(a,i,j); } } } } const char vazir=219; const char khali=32; const char col=179; const char row=196; const char bet=197; void chaapKon(int a[][8]) { for (int i=0;i<8;i++) { for (int j=0;j<8;j++) { if (a[i][j]==1) { cout << ' ' << khali << khali << ' '; if (j<7) cout << col; } else if(a[i][j]==2) { cout << ' ' << vazir << vazir << ' '; if (j<7) cout << col; } } cout << endl; if (i<7) { cout << row << row << row; for (int k=4;k<=39;k++) { if (k%5==0) cout << bet; else cout << row; } } cout << endl; } } int isCorrect(int a[][8]) { int qCount=0; for (int i=0;i<8;i++) for (int j=0;j<8;j++) if (a[i][j]==2) qCount++; if (qCount==8) return(1); else return(0); }

8 Queen better