N皇后

/*N皇后问题*/

#include <stdio.h>
#include <math.h>
#include <iostream>
#define N 4

using namespace std;

int isplace(int pos[], int k)
{
	int i;
	for ( i = 1; i < k; i++)
	{
		if ( pos[i]==pos[k] || fabs(i - k) == fabs(pos[i] - pos[k]))//1
		{
			return 0;
		}
	}
	return 1;
}

int main()
{
	int i, j, count = 1;
	int pos[N + 1];
	//初始化位置
	for (i = 1; i <= N; i++)
	{
		pos[i] = 0;
	}
	j = 1;//2
	while (j >= 1)
	{
		pos[j] = pos[j] + 1;
		//尝试摆放第j个皇后
		while (pos[j] <= N&&isplace(pos, j) == 0)//3
		{
			pos[j] = pos[j] + 1;
		}

		//得到一个摆放方案
		if (pos[j] <= N&&j == N)//4
		{
			printf("方案%d;", count++);
			for (i = 1; i <= N; i++)
			{
				printf("%d", pos[i]);
			}
			printf("\n");
		}

		if (pos[j] <= N&&j < N)//5
		{
			j = j + 1;
		}
		else
		{
			pos[j] = 0;
			j = j - 1;
			//此处是空(5)
		}
	}
	system("pause");
	return 0;
}