solution_for_8_queens.cpp

来自「八皇后问题的最好解法,利用回朔法的典型例子,还有其他几个好程序」· C++ 代码 · 共 42 行

#include <iostream.h>
#include <math.h>
int main()
{
	int queen[8];
	int total=0;
	int i,j,k;
	for(i=0;i<8;i++)queen[i]=0;
	for(i=1;;)
	{
		if(queen[i]<8)
		{
			k=0;
			while(k<i&&(queen[k]-queen[i])&&(abs(queen[k]-queen[i])-abs(k-i)))k++;
			if(k<=i-1)
			{
				queen[i]++;
				continue;
			}
			i++;
			if(i<8)continue;
			for(j=0;j<8;j++)cout<<queen[j];
			cout<<"  ";
			total++;
			if(total%5==0)cout<<endl;
			queen[7]++;
			i=7;
		}
		else
		{
			queen[i]=0;
			i--;
			if(i<0)
			{
				cout<<"总数"<<total<<endl;
				return 0;
			}
			else queen[i]++;
		}
	}
}