111.cpp

来自「马遍历的算法」· C++ 代码 · 共 37 行

#include<iostream.h>
int i,sx[64]={0},sy[64]={0};
bool map[8][8];
bool f(int step,int way,int x,int y)
{
    
    if(way==1){x=x+2;y=y+1;}
    if(way==2){x=x+2;y=y-1;}
    if(way==3){x=x-2;y=y+1;}
    if(way==4){x=x-2;y=y-1;}
    if(way==5){x=x+1;y=y+2;}
    if(way==6){x=x+1;y=y-2;}
    if(way==7){x=x-1;y=y+2;}
    if(way==8){x=x-1;y=y-2;}
    if(x<0||y<0||x>=8||y>=8||map[x][y])return false;
    sx[step-1]=x;sy[step-1]=y;
	if(step==64)return true;
    map[x][y]=true;
    for(i=1;i<9;i++)
    {
        if(f(step+1,i,x,y))return true;
    }
	map[x][y]=false;
    return false;
}
main()
{
	int k;
	bool asdf;
	asdf=f(1,0,1,2);
	if(!asdf)
	{
		for(k=0;k<64;k++)cout<<"The "<<k+1<<" step:("<<sx[k]<<","<<sy[k]<<")"<<endl;
	}
	else cout<<"impossible"<<endl;

}