下面资料是关于C++解决八皇后问题的代码,应该能对码农有些用。
static int gEightQueen[8] = {0};
static int gCount = 0;
void print()
{
int outer;
int inner;
for(outer = 0; outer <8; outer ++){
for(inner = 0; inner < gEightQueen[outer]; inner ++)
printf("# ");
for(inner = gEightQueen[outer] + 1; inner < 8; inner ++)
printf("n");
}
printf("=====================================n");
}
b)添加位置合法性的函数判断
int check_pos_valid(int loop, int value)
{
int index;
int data;
for(index = 0; index < loop; index ++){
data = gEightQueen[index];
if(value == data)
return 0;
if((index +