8.txt

来自「Data Structure Question」· 文本 代码 · 共 46 行

n皇后问题

//n皇后问题
#include <iostream.h>
#include <iomanip.h>
#include <conio.h>
#define n 8
int a[n+1],c[n+1];
int l[2*n],r[2*n+1];
int count=0;
void place(int);
int main()
{
    int k;
for(k=1;k<=n;k++)c[k]=1;
for(k=1;k<=2*n-1;k++)l[k]=1;
for(k=2;k<=2*n;k++)r[k]=1;
place(1);
if(count==0)cout<<"No Answer!"<<endl;
cout<<"Program end."<<endl;
getch();
return 0;
}
void place(int i)
{
    int j,k;
for(j=1;j<=n;j++)
{
    if((c[j]==1)&&(l[i-j+n]==1)&&(r[i+j]==1))
{
    a[i]=j;
c[j]=0;l[i-j+n]=0;r[i+j]=0;
if(i<n) place(i+1);
else
{
    for(k=1;k<=n;k++)
    cout<<setw(4)<<a[k];
count++;
cout<<" count="<<count<<endl;
if(count%20==0){cout<<"Press any key to continue."<<endl;getch();}
}
c[j]=1;l[i-j+n]=1;r[i+j]=1;
}
}
}