用回溯法解决n皇后问题
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <math.h>
bool ismeetcondition(int *solution,int paraT){
for(int i=0;i<paraT-1;i++){
if (solution[i]==solution[paraT-1] || abs(paraT-i-1)==abs(solution[paraT-1]-solution[i])){
return false;
}
}
return true;
}
void move(int *solution,int paraN,int paraT){
if (paraT>paraN){
for (int i=0;i<paraN;i++){
printf("%d ",solution[i]);
}
printf("\n");
}
else{
for (int q=0;q<paraN;q++){
solution[paraT-1]=q+1;
if(ismeetcondition(solution,paraT)){
move(solution,paraN,paraT+1);
}
}
}
}
int main(){
int i,paraN;
scanf("%d",¶N);
int* solution = (int*)malloc((paraN + 1) * sizeof(int));
for (i = 0; i <= paraN; i ++)
solution[i] = 0;
move(solution,paraN,1);
return 0;
}