自己寫的馬踏棋盤算法，怎么是死循環(huán)，一直沒找到原因。。

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#define MAX_VERTEX_NUM 10
#define X 8
#define Y 8    
int chess[X][Y];

int nextxy(int *x, int *y, int count) {
    switch (count)
    {
    case 0:
        if (*x + 1 <= X - 1 && *y - 2 >= 0 && chess[*x + 1][*y - 2] == 0)
        {
            *x += 1;
            *y -= 2;
            return 1;
        }
        break;
    case 1:
        if (*x + 2 <= X - 1 && *y - 1 >=0 && chess[*x + 2][*y - 1] == 0)
        {
            *x += 2;
            *y -= 1;
            return 1;
        }
        break;
    case 2:
        if (*x + 2 <= X - 1 && *y + 1 <= Y - 1 && chess[*x + 2][*y + 1] == 0)
        {
            *x += 2;
            *y += 1;
            return 1;
        }
        break;
    case 3:
        if (*x + 1 <= X - 1 && *y + 2 <= Y-1 && chess[*x + 1][*y + 2] == 0)
        {
            *x += 1;
            *y += 2;
            return 1;
        }
        break;
    case 4:
        if (*x - 1 >= 0 && *y + 2 <= Y-1 && chess[*x -1][*y+2] == 0)
        {
            *x -= 1;
            *y += 2;
            return 1;
        }
        break;
    case 5:
        if (*x - 2 >= 0 && *y + 1 <= Y - 1 && chess[*x - 2][*y + 1] == 0)
        {
            *x -= 2;
            *y += 1;
            return 1;
        }
        break;
    case 6:
        if (*x - 2 >= 0 && *y - 1 >= 0 && chess[*x - 2][*y - 1] == 0)
        {
            *x -= 2;
            *y -= 1;
            return 1;
        }
        break;
    case 7:
        if (*x - 1 >= 0 && *y - 2 >=0 && chess[*x - 1][*y - 2] == 0)
        {
            *x -= 1;
            *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");
}

int TraveChessBoard(int x, int y, int tag) {
    chess[x][y] = tag;
    int x1 = x, y1 = y, flag = 0, count = 0;

    if (tag == X*Y)
    {
        print();
        return 1;
    }
    flag = nextxy(&x1, &y1, count);

    while (0 == flag && count<7)
    {
        count++;
        flag = nextxy(&x1, &y1, count);
    }

    //find ma next(x1,y1),find ok flag=1;
    while (flag)
    {
        if (TraveChessBoard(x1, y1, tag + 1)) {
            return 1;
        }
        x1 = x;
        y1 = y;
        count++;
        flag = nextxy(&x1, &y1, count);
        while (0 == flag && count<7)
        {
            count++;
            flag = nextxy(&x1, &y1, count);
        }


    //xia yi bu zuo biao
    }

    if (flag == 0)
    {
        chess[x][y] = 0;
    }
    return 0;
}





int main() {
    int i, j;
    clock_t start, finish;
    start = clock();
    for (i = 0; i < X; i++)
    {
        for (j = 0; j < Y; j++)
        {
            chess[i][j] = 0;
        }

    }
    if (!TraveChessBoard(2, 0, 1))
    {
        printf("bao qian,shi bai le");
    }
    finish = clock();
    printf("\nben ci ji suan shi jian:%fmiao\n\n", (double)((finish - start) / CLOCKS_PER_SEC));



    return 0;


    


}

這是代碼，感覺沒問題，但是運行在88，在起始點為2,0點一直是死循環(huán)，不知道為什么，有時候棋盤小點，起始點選好又可以得出正確答案，有時候又得不出，有時候又是死循環(huán)，不知道為什么，理論在88的棋盤，2,0起始點肯定有解的啊，調(diào)試了半天，算法感覺也沒寫錯，不知道怎么回事。。。。費解?。?/p>