n皇后问题

#include <iostream>
#include <fstream>
#include <queue>
#include <cmath>
using namespace std;

const int MAX = 10;
int n;   // 皇后个数
int bestx[MAX]; //解向量

class Node
{
public:
int dep;      //当前层
int *x;       //解向量

Node(int d)
{
x = new int[n+1];
dep = d;
}

bool ok()  //是否满足条件
{
for(int i=1; i<dep; i++)
if(x[i] == x[dep] || abs(x[i] - x[dep]) == abs(i - dep))
return false;
return true;
}

};

void search()
{
queue<Node> q;
Node enode(0);
for(int j=1; j<=n; j++)
enode.x[j] = j;
while(true)
{
if(enode.dep == n)
{
copy(enode.x, enode.x+n+1, bestx);
break;
}
else
{
for(int i=enode.dep+1; i<=n; i++)
{
Node now(enode.dep+1);
copy(enode.x, enode.x+n+1, now.x);
now.x[now.dep] = enode.x[i];
now.x[i] = enode.x[now.dep];
if(now.ok())
q.push(now);
}
}
if(q.empty())
break;
else
{
enode = q.front();
q.pop();
}
}
}

int main()
{
cout << "输入皇后个数：";
cin >> n;

search();
cout << "\n皇后的放置方案为：" << endl;
for(int i=1; i<=n; i++)
cout << bestx[i] << " ";

cout << endl;
cout << endl;
return 0;
}