八皇后问题解法

参考网址：http://blog.csdn.net/feixiaoxing/article/details/6877965

#include <stdio.h>
#define queens 8     

static int gEightQueen[queens] = {0};
static int gCount = 0;

void print()                        //图形输出皇后的位置
{
    int outer;
	int inter;
	for(outer=0;outer<queens;outer++)
	{
		for (inter=0;inter<gEightQueen[outer];inter++)
		{
             printf("*");
		}
		printf("#");
		for (inter=gEightQueen[outer]+1;inter<queens;inter++)
		{
			printf("*");
		}
		printf("\n");
	}
	printf("=================\n");
}
void print_int()                    //数字代表皇后在棋盘上的位置
{
	int outer;
	printf(((gCount-1)%3?"%2d: ":"\n%2d: "),gCount);
	for (outer=0;outer<queens;outer++)
	{
		printf("%2d",gEightQueen[outer]);
	}
	printf("  ");
}
int check_pos_valid(int loop,int value)  //检查loop行皇后取value值是否合法
{
	int index;
	int data;
	for (index=0;index<loop;index++)
	{
		data=gEightQueen[index];
		if (value==data)
		{
			return 0;
		}
		if ((data+index)==(value+loop))
		{
			return 0;
		}
		if ((index-data)==(loop-value))
		{
			return 0;
		}
	}
	return 1;
}

void queen(int index)                //主算法
{
	int loop;
	for (loop=0;loop<queens;loop++)
	{
		if (check_pos_valid(index,loop))
		{
			gEightQueen[index]=loop;
			if ((queens-1)==index)
			{
                 gCount++;
				 print_int();
				 printf("\n");
				 print();
				// gEightQueen[index] = 0;
				 return ;
			}
			queen(index+1);
			gEightQueen[index] = 0;
		}
	}
}
void main()
{
	queen(0);
}