N皇后问题算法

#include <iostream>
using namespace std;
int n;
int *result;
bool find(int);
bool put(int, int);
int main()
{
cout << "input n:" << endl;
cin >> n;
result = new int[n+1];
for (int i = 1; i <= n; ++i)
result[i] = 0;
if(find(1))
{
//输出结果
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
if (result[i] ==j)
cout << "■";
else
cout << "□";
cout << endl;
}
}
else
cout << "No solution!" << endl;
return 0;
}
bool find(int i)
{
for (int j = 1; j <= n; ++j)
{
if (put(i,j))
{
result[i] = j;
if (i == n)
return true;
else if (find(i + 1))
return true;
else
result[i] = 0;
}
}
return false;
}
//(i,j)点是否可以放子
bool put(int i, int j)
{
for (int k = 1; k < i; ++k)
if (j == result[k] || i + j == k + result[k] || i - j == k - result[k] )
return false;
return true;
}