趣味算法-马踏棋盘

#include <stdio.h>

typedef struct _next_pos
{
int m_x;
int m_y;
} next_pos_t;

next_pos_t next_pos[8]={{-1,2},{-2,1},{-2,-1},{-1,-2},
{1,-2},{2,-1},{2,  1},{ 1, 2}};

int chess[8][8];
int nResult = 0;
next_pos_t arrRes[64];

int move(int nPosX, int nPosY)
{
int i = 0;
int nRet = 0;
for (i=0; i<8; i++)
{
if ((nPosX+next_pos[i].m_x < 0) || (nPosX+next_pos[i].m_x > 7)
|| (nPosY+next_pos[i].m_y < 0) || (nPosY+next_pos[i].m_y > 7))
{
continue;
}
if (chess[nPosX+next_pos[i].m_x][nPosY+next_pos[i].m_y] == 0)
{
chess[nPosX+next_pos[i].m_x][nPosY+next_pos[i].m_y] = 1;
nResult++;
arrRes[nResult].m_x = nPosX+next_pos[i].m_x;
arrRes[nResult].m_y = nPosY+next_pos[i].m_y;
nRet = move(nPosX+next_pos[i].m_x, nPosY+next_pos[i].m_y);
if (nRet == -1)
{
chess[nPosX+next_pos[i].m_x][nPosY+next_pos[i].m_y] = 0;
nResult--;
}
}
}

if (nResult == 63)
nRet = 0;
else
nRet = -1;

return nRet;
}

int main()
{
int i = 0;

memset(chess, 0, sizeof(chess));
memset(arrRes,0, sizeof(arrRes));
arrRes[0].m_x=0;
arrRes[0].m_y=0;
i = move(0, 0);

if (i == 0)
{
printf("find the solution\n");
for (i=0;i<64;i++)
{
if (i%8 == 0)
{
printf("\n");
}
printf("X=%d  Y=%d; ", arrRes[i].m_x, arrRes[i].m_y);
}
}
scanf("%d", &i);
return 0;
}