C语言求8皇后问题的回溯程序，要简单的！！

发布网友 发布时间：2023-09-28 15:21

我来回答

共4个回答

热心网友 时间：2024-10-08 10:30

#include "stdio.h"
int attacked(int *array,int position){
int flag=-1;
float step;
if(position==1) return flag;
for(step=1.00;step<position;step++){
if(*(array+(int)step)==*(array+position)||step==position) return
1;
if(((*(array+(int)step)-*(array+position))/(step-position))==1||((*
(array+(int)step)-*(array+position))/(step-position))==-1){
flag=1;
break;
}
}
return flag;
}
void main(void){
int countSum,queenSum,printCount,*queenArray,queenPosition=0;
int tempArray[20]={6666,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
countSum=1;
queenArray=tempArray;
printf("input you queenSum here:");
scanf("%d",&queenSum);
fflush(stdin);
if(queenSum<4){
printf("the %d queen's sum is 0\n",queenSum);
return;
}
for(;;){
if(countSum<queenSum){
if(countSum==1&&*(queenArray+countSum)==1) countSum++;
if(attacked(queenArray,countSum)==1){
if(*(queenArray+countSum)>=queenSum){
if(*(queenArray+countSum-1)<queenSum){
++*(queenArray+(--countSum));
*(queenArray+countSum+1)=0;
}
else{
*(queenArray+countSum--)=0;
if(*(queenArray+countSum)<queenSum) ++*(queenArray+countSum);
else{
if(countSum==1&&*(queenArray+countSum)==queenSum) break;
*(queenArray+countSum--)=0;
++*(queenArray+countSum);
}
}
}
else
++*(queenArray+countSum);
}
else
++*(queenArray+(++countSum));
}
else{
if(attacked(queenArray,countSum)==1){
if(*(queenArray+countSum)>=queenSum){
if(*(queenArray+countSum-1)<queenSum){
++*(queenArray+(--countSum));
*(queenArray+countSum+1)=0;
continue;
}
else{
*(queenArray+countSum--)=0;
if(*(queenArray+countSum)<queenSum) ++*(queenArray+countSum);
else{
*(queenArray+countSum--)=0;
++*(queenArray+countSum);
}
continue;
}
}
else {
++*(queenArray+countSum);
continue;
}
}
queenPosition++;
for(printCount=1;printCount<=queenSum;printCount++)
printf("%3d%",*(queenArray+printCount));
if(printCount>=queenSum) printf("\n");
if(*(queenArray+countSum)>=queenSum){
++*(queenArray+(--countSum)); //the "++" priority is different
from turbo C
*(queenArray+countSum+1)=0;
}
++*(queenArray+countSum);
}
}
printf("the %d queen's sum is %d\n",queenSum,queenPosition);
}

热心网友 时间：2024-10-08 10:31

#include "stdafx.h"
#include <iostream.h>
int bijiao(int q[],int row,int col)
{
int x;
for(x=0;x<row;x++)
{ if(col==q[x] || row+col==x+q[x] || row-col==x-q[x] )
return 0;
}

return 1;

}

int anquan(int q[],int row)
{
int col;

for(col=q[row]+1;col<8;col++){
if( bijiao(q,row,col) )
return col;

}

return -1;

}

int huanghou(int q[])
{
int row,col;

for(row=1;row<8;row++){
q[row]=-1;
}

q[0]=0;
row=1;

while(row>=0&&row<8){
col=anquan(q,row);
if(col!=-1)
q[row++]=col;
else
q[row--]=-1;

}
return (8==row);

}
void main()
{
int q[8];
int x;

huanghou(q);
for(x=0;x<8;x++)
printf(" %2d ",q[x]);

}
尽量最简单化了

热心网友 时间：2024-10-08 10:31

#include <stdio.h>
#include <memory.h>
int sum,lie[8],xie[15],xie1[15];
void q(int n)
{
for(int i=0;i<8;i++)
{
if(lie[i]!=1&&xie[n+i]!=1&&xie1[i-n+7]!=1)
{
lie[i]=xie[n+i]=xie1[i-n+7]=1;
if(n==7)
sum++;
else
q(n+1);
lie[i]=xie[n+i]=xie1[i-n+7]=0;
}
}
}
main()
{
memset(lie,0,sizeof(lie));
memset(xie,0,sizeof(xie));
memset(xie1,0,sizeof(xie1));
sum=0;
q(0);
printf("总共有%d种放法",sum);
}

热心网友 时间：2024-10-08 10:32

gdgzzch.blog.163.com
《n皇后问题》

参考资料：gdgzzch.blog.163.com