p; {
*x=*x+1;
*y=*y+2;
return 1;
}
break;
case 4:
if(*x-2>=0 && *y-1>=0 && chess[*x-2][*y-1]==0)
{
*x=*x-2;
*y=*y-1;
return 1;
}
break;
case 5:
if(*x-2>=0 && *y+1<=Y-1 && chess[*x-2][*y+1]==0)
{
*x=*x-2;
*y=*y+1;
return 1;
}
break;
case 6:
if(*x-1>=0 && *y-2>=0 && chess[*x-1][*y-2]==0)
{
*x=*x-1;
*y=*y-2;
return 1;
}
break;
case 7:
if(*x-1>=0 && *y+2<=Y-1 && chess[*x-1][*y+2]==0)
{
*x=*x-1;
*y=*y+2;
return 1;
}
break;
default:
break;
}
return 0;
}
int TravelChessBoard(int x, int y, int tag) /*深度优先搜索地"马踏棋盘"*/
{
int x1=x, y1=y, flag=0, count=0;
chess[x][y]=tag;
if(tag == X*Y)
{
return 1;
}
flag=nextxy(&x1, &y1, count);
while(flag==0 && count<7)
{
count=count+1;
flag=nextxy(&x1, &y1, count);
}
while(flag)
{
if(TravelChessBoard(x1, y1, tag+1))
return 1;
x1=x;
y1=y;
count=count+1;
flag=nextxy(&x1, &y1, count); /*寻找下一个(x,y)*/
while(flag==0 && count<7)
{ /*循环地寻找下一个(x,y)*/
count=count+1;
flag=nextxy(&x1, &y1, c