/*
回溯算法
*/
// 8皇后问题
static const int n = 8;
// 下标表示行,值表示列
int Column_num[n+1] = {0};
int index = 0;
// 解的个数
int anwser_num = 0;
int Palace(int Col[], int index)
{
int i;
int Row_diff,Col_diff;
// 判断1,2,...index-1 个皇后是否相互兼容
for (i = 1; i < index; i++)
{
Row_diff = abs(index - i);
Col_diff = abs(Col[index] - Col[i]);
if (Col[i] == Col[index] || Row_diff == Col_diff)
{
return 0; // 不兼容
}
}
return 1; // 兼容
}
void N_Quee