八皇后--深度优先搜索

#include<iostream>
#include <vector>
using namespace std;
class CQueen
{

private:
	int m_nQueen; //8
	vector<bool> m_Colomn;    //path已经占据的列
	vector<bool> m_MainDiagonal;   //path已经占据的主对角线
	vector<bool> m_MinorDiagonal;     //path已经占据的次对角线
	vector<vector<int>> Ans;  //
	
public:
	CQueen(int n):m_nQueen(n)
	{
		m_Colomn.resize(n,false);
		m_MainDiagonal.resize(2*n-1,false);
		m_MinorDiagonal.resize(2*n-1,false);
	}

	void Queen()
	{
		int *path=new int[m_nQueen];
		CalcNQueen(path,0);
	}
	void CalcNQueen(int *path,int row)
	{
		if (row==m_nQueen)
		{
			Ans.push_back(vector<int>(path,path+m_nQueen));
			return;
		}
		for (int col=0;col<m_nQueen;col++)
		{
			if (CanLay(row,col))
			{
				path[row]=col;
				m_Colomn[col]=true;
				m_MinorDiagonal[row+col]=true;
				m_MainDiagonal[row-col+m_nQueen-1]=true;
				CalcNQueen(path,row+1);
				m_Colomn[col]=false;
				m_MinorDiagonal[row+col]=false;
				m_MainDiagonal[row-col+m_nQueen-1]=false;
			}
		}
	}
	bool CanLay(int row,int col)
	{
		if (!m_Colomn[col]&&!m_MinorDiagonal[row+col]&&!m_MainDiagonal[row-col+m_nQueen-1])
		{
			return true;
		}
		else
			return false;
	}
	void Print()
	{
		cout<<"所有解的个数:"<<(int)Ans.size()<<endl;
		for (int i=0;i<Ans.size();i++)
		{
			PrintOne(Ans[i]);
			cout<<endl;
		}
	}
	void PrintOne(vector<int> &v)
	{
		for (vector<int>::const_iterator it=v.begin();it!=v.end();it++)
		{
			cout<<*it<<' ';
		}
	}
};




int main()
{
	CQueen queen(8);
	queen.Queen();
	queen.Print();
	return 0;
}

所有解的个数:92
0 4 7 5 2 6 1 3
0 5 7 2 6 3 1 4
0 6 3 5 7 1 4 2
0 6 4 7 1 3 5 2
1 3 5 7 2 0 6 4
1 4 6 0 2 7 5 3
1 4 6 3 0 7 5 2
1 5 0 6 3 7 2 4
1 5 7 2 0 3 6 4
1 6 2 5 7 4 0 3
1 6 4 7 0 3 5 2
1 7 5 0 2 4 6 3
2 0 6 4 7 1 3 5
2 4 1 7 0 6 3 5
2 4 1 7 5 3 6 0
2 4 6 0 3 1 7 5
2 4 7 3 0 6 1 5
2 5 1 4 7 0 6 3
2 5 1 6 0 3 7 4
2 5 1 6 4 0 7 3
2 5 3 0 7 4 6 1
2 5 3 1 7 4 6 0
2 5 7 0 3 6 4 1
2 5 7 0 4 6 1 3
2 5 7 1 3 0 6 4
2 6 1 7 4 0 3 5
2 6 1 7 5 3 0 4
2 7 3 6 0 5 1 4
3 0 4 7 1 6 2 5
3 0 4 7 5 2 6 1
3 1 4 7 5 0 2 6
3 1 6 2 5 7 0 4
3 1 6 2 5 7 4 0
3 1 6 4 0 7 5 2
3 1 7 4 6 0 2 5
3 1 7 5 0 2 4 6
3 5 0 4 1 7 2 6
3 5 7 1 6 0 2 4
3 5 7 2 0 6 4 1
3 6 0 7 4 1 5 2
3 6 2 7 1 4 0 5
3 6 4 1 5 0 2 7
3 6 4 2 0 5 7 1
3 7 0 2 5 1 6 4
3 7 0 4 6 1 5 2
3 7 4 2 0 6 1 5
4 0 3 5 7 1 6 2
4 0 7 3 1 6 2 5
4 0 7 5 2 6 1 3
4 1 3 5 7 2 0 6
4 1 3 6 2 7 5 0
4 1 5 0 6 3 7 2
4 1 7 0 3 6 2 5
4 2 0 5 7 1 3 6
4 2 0 6 1 7 5 3
4 2 7 3 6 0 5 1
4 6 0 2 7 5 3 1
4 6 0 3 1 7 5 2
4 6 1 3 7 0 2 5
4 6 1 5 2 0 3 7
4 6 1 5 2 0 7 3
4 6 3 0 2 7 5 1
4 7 3 0 2 5 1 6
4 7 3 0 6 1 5 2
5 0 4 1 7 2 6 3
5 1 6 0 2 4 7 3
5 1 6 0 3 7 4 2
5 2 0 6 4 7 1 3
5 2 0 7 3 1 6 4
5 2 0 7 4 1 3 6
5 2 4 6 0 3 1 7
5 2 4 7 0 3 1 6
5 2 6 1 3 7 0 4
5 2 6 1 7 4 0 3
5 2 6 3 0 7 1 4
5 3 0 4 7 1 6 2
5 3 1 7 4 6 0 2
5 3 6 0 2 4 1 7
5 3 6 0 7 1 4 2
5 7 1 3 0 6 4 2
6 0 2 7 5 3 1 4
6 1 3 0 7 4 2 5
6 1 5 2 0 3 7 4
6 2 0 5 7 4 1 3
6 2 7 1 4 0 5 3
6 3 1 4 7 0 2 5
6 3 1 7 5 0 2 4
6 4 2 0 5 7 1 3
7 1 3 0 6 4 2 5
7 1 4 2 0 6 3 5
7 2 0 5 1 4 6 3
7 3 0 2 5 1 6 4