递归回溯法求解N皇后

/*
 * @file				RecursiveBacktrackNqueens.cpp
 * @brief				to use RecursiveBacktrack's way solve Nqueens' problem
 * @author				taoxiaoxiao
 * @date              	12-1-2013
*/
//递归回溯法求解N皇后  
//输出解决方案数和行列标（只打印第一个解决方案） 

#include <iostream>
using namespace std;

#define MAXN 13 
int x[MAXN + 1], y[MAXN+1], n, sum;
bool isGo=false;

bool place(int k)
{
	for (int j = 1; j < k; ++j)
	{
		if (x[j] == x[k] || abs(x[j] - x[k]) == abs(j - k))
			return false;
	}
	return true;
}

void RecursiveBacktrackNqueens(int k)
{
	int i;
	if (k > n)
	{
		++sum;
		if (isGo == false)
		{
			for (i = 1; i <= n; ++i)
				y[i] = x[i];
			isGo = true;
		}
	}
	else
	{
		for (i = 1; i <= n; ++i)
		{
			x[k] = i;
			if (place(k))
				RecursiveBacktrackNqueens(k + 1);
		}
	}
}

int main()
{
	system("title 递归回溯法---Nqueens");
	system("color 0a");
	cin >> n;

	RecursiveBacktrackNqueens(1);
	cout << sum << endl;
	for (int i = 1; i <= n; ++i)
		cout << i << " " << y[i] << endl;

	return 0;
}