附录：8皇后问题代码

#include<stdio.h>

int gEightQueen[8]={0};

int gCount=0;

void print_cross()

{

int i,inner;

for(i=0;i<8;i++)

{

for(inner=0;inner<gEightQueen[i];inner++)

{

printf("_|");

}

printf("Q|");

for(;inner<7;inner++)

{

printf("_|");

}

printf("\n");

}

printf("========================\n");

}

int check_pos_vaild(int loop,int value)//本次lonp行，value列

{

int index,data;//index以前行标记，调用以前存放的列位置

for(index=0;index<loop;index++)

{

data = gEightQueen[index];//

if(value==data)//

return 0;

if((index+data)==(loop+value))

return 0;

if((index-data)==(loop-value))

return 0;

}

return 1;

}

void eight_queen(int index)j//index，行标记

{

int loop;列位置

for(loop=0;loop<8;loop++)

{

if(check_pos_vaild(index,loop))

{

gEightQueen[index]=loop;

if(7==index)

{

gCount++;

print_cross();

gEightQueen[index]=0;

return;

}

eight_queen(index+1);

gEightQueen[index]=0;

}

}

}

int main()

{

eight_queen(0);

printf("total=%d\n",gCount);

return 0;

}