wdf.rar_WDF_骑士巡游_骑士巡游问题

#include<iostream.h>//骑士 bool MA(int,int,int,bool**); void out(int,int,int,int); void main() { int x,y,n; cout<<"x="; cin>>x; cout<<"y="; cin>>y; cout<<"n="; cin>>n; bool **c;//记录点c[x][y]是否已走 true表已走false表未走 c=new bool*[n]; for(int i=0;i<n;i++) { c[i]=new bool[n]; } int a,b; for(a=0;a<n;a++) { for(b=0;b<n;b++) { c[a][b]=false;//所要的棋盘内的点未走 } } MA(x,y,n,c);//执行 if(!MA(x,y,n,c)) { cout<<"NO"; } delete c; } bool MA(int x,int y,int n,bool **c) { c[x][y]=true;//此点已走 int p,q,a,b=1; for(p=0;p<n;p++) { for(q=0;q<n;q++) { a=c[p][q]; b=a*b; } } if(b==1) { return true;//以上检验是否全走 } if(0<=(x+1)&&(x+1)<n&&0<=(2+y)&&(2+y)<n&&!c[x+1][2+y])//八个方向递归 { c[x+1][2+y]=true; if(MA(x+1,y+2,n,c)) { out(x,y,x+1,y+2); return true; } c[x+1][2+y]=false; } if(0<=(x+2)&&(x+2)<n&&0<=(1+y)&&(1+y)<n&&!c[x+2][1+y]) { c[x+2][1+y]=true; if(MA(x+2,y+1,n,c)) { out(x,y,x+2,y+1); return true; } c[x+2][1+y]=false; } if(0<=(x+2)&&(x+2)<n&&0<=(y-1)&&(y-1)<n&&!c[x+2][y-1]) { c[x+2][y-1]=true; if(MA(x+2,y-1,n,c)) { out(x,y,x+2,y-1); return true; } c[x+2][y-1]=false; } if(0<=(x+1)&&(x+1)<n&&0<=(y-2)&&(y-2)<n&&!c[x+1][y-2]) { c[x+1][y-2]=true; if(MA(x+1,y-2,n,c)) { out(x,y,x+1,y-2); return true; } c[x+1][y-2]=false; } if(0<=(x-1)&&(x-1)<n&&0<=(y-2)&&(y-2)<n&&!c[x-1][y-2]) { c[x-1][y-2]=true; if(MA(x-1,y-2,n,c)) { out(x,y,x-1,y-2); return true; } c[x-1][y-2]=false; } if(0<=(x-2)&&(x-2)<n&&0<=(y-1)&&(y-1)<n&&!c[x-2][y-1]) { c[x-2][y-1]=true; if(MA(x-2,y-1,n,c)) { out(x,y,x-2,y-1); return true; } c[x-2][y-1]=false; } if(0<=(x-2)&&(x-2)<n&&0<=(y+1)&&(y+1)<n&&!c[x-2][1+y]) { c[x-2][1+y]=true; if(MA(x-2,y+1,n,c)) { out(x,y,x-2,y+1); return true; } c[x-2][1+y]=false; } if(0<=(x-1)&&(x-1)<n&&0<=(y+2)&&(y+2)<n&&!c[x-1][2+y]) { c[x-1][2+y]=true; if(MA(x-1,y+2,n,c)) { out(x,y,x-1,y+2); return true; } c[x-1][2+y]=false; } c[x][y]=false;//失败 将此点定为未走 return false; } void out(int Z,int X,int C,int V) { cout<<"("<<C<<","<<V<<")"<<endl;//输出 cout<<" !"<<endl; cout<<"("<<Z<<","<<X<<")"<<endl; }