基本信息

---

下载

   友情提示：（无需注册或充值，赞助后即可获取资源下载链接）

---

     嘿，亲！知识可是无价之宝呢，但咱这精心整理的资料也耗费了不少心血呀。小小地破费一下，绝对物超所值哦！如有下载和支付问题，请联系我们QQ(微信同号)：813200300

本次赞助数额为： 2 元　

支付宝支付

微信支付

   源码介绍

---

#include <stdio.h>
#define X 8
#define Y 8
int chess[X][Y];

int nextxy(int *x, int *y, int count)  /*找到基于x,y位置的下一个可走的位置*/
{
    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;
}

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, count);
        }
    }
    if(flag == 0)
        chess[x][y]=0;
    return 0;
}
int main()
{
    int i, j;
    for(i=0; i<X; i  )
        for(j=0; j<Y; j  )
            chess[i][j]=0;
    if(TravelChessBoard(2, 0, 1))
    {
        for(i=0; i<X; i  )
        {
            for(j=0; j<Y; j  )
                printf("%-5d", chess[i][j]);
            printf("\n");
        }
        printf("The horse has travelled the chess borad\n");
    }
    else
        printf("The horse cannot travel the chess board\n");
    return 0;
}