前一阵子写了马踏棋盘,感觉理解的还可以,就把他们贴出来,不太理解的小伙伴们参考一下
#include <stdio.h>
#define X 8
#define Y 8
int chess[X][Y];
// 找到基于(x,y)位置的下一个可走的位置
int nextxy(int *x,int *y,int count)
{
switch(count)
{
case 0:
if( *x+2<=X-1 && *y-1>=0 && chess[*x+2][*y-1]==0 )
{
*x = *x + 2;
*y = *y - 1;
return 1;
}
break;
case 1:
if( *x+2<=X-1 && *y+1<=Y-1 && chess[*x+2][*y+1]==0 )
{
*x = *x + 2;
*y = *y + 1;
return 1;
}
break;
case 2:
if( *x+1<=X-1 && *y-2>=0 && chess[*x+1][*y-2]==0 )
{
*x = *x + 1;
*y = *y - 2;
return 1;
}
break;
case 3:
if( *x+1<=X-1 && *y+2<=Y-1 && chess[*x+1][*y+2]==0 )
{
*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;
}
//遍历棋盘
void print()
{
int i, j;
for( i=0; i < X; i++ )
{
for( j=0; j < Y; j++ )
{
printf("%2d\t", chess[i][j]);
}
printf("\n");
}
printf("\n");
}
//深度优先遍历棋盘
//x,y为起始坐标
int TravelChessBoard(int x,int y,int tag)
{
int x1=x,y1=y,flag=0,count=0;
chess[x][y]=tag;
//tag=X*Y,那么完成棋盘遍历
if(X*Y==tag)
{
//遍历棋盘
print();
return 1;
}
//走下一步棋盘
flag=nextxy( &x1, &y1,count);
while(flag==0 && count<=7)
{
count++;
flag=nextxy( &x1, &y1,count);
}
while(flag)
{
//不断往后走,直到 棋盘全部遍历 或 无路可走
if(TravelChessBoard( x1, y1, tag+1))
{
return 1;
}
//若无路可走,则退回上一步,走另一步棋盘(此时的x,y属于当前TravelChessBoard函数)
x1=x;
y1=y;
count++;
flag=nextxy( &x1, &y1,count);
while(flag==0 && count<=7)
{
count++;
flag=nextxy( &x1, &y1,count);
}
}
//无路可走,设置此时马的位置为0(此时的x,y属于while循环里的TravelChessBoard函数)
//此步后,退到上一个while里,继续执行上一个TravelChessBoard函数
if(flag==0)
{
chess[x][y]=0;
}
return 0;
}
int main()
{
TravelChessBoard(2,0,1);
}