骑士走棋盘

//骑士走棋盘
#include<stdio.h>
int board[8][8] = { 0 };
int main(void) {
	int startx, starty;
	int i, j;
	printf("输入起始点：");
	scanf("%d%d", &startx, &starty);
	if (travel(startx, starty)) {
		printf("游历完成！\n");
	}
	else {
		printf("游历失败！\n");
	}
	for (i = 0; i < 8; i++) {
		for (j = 0; j < 8; j++) {
			printf("%2d", board[i][j]);
		}
		putchar('\n');
	}
	return 0;
}
int travel(int x, int y) {
	int ktmove1[8] = { -2,-1,1,2,2,1,-1,-2 };
	int ktmove2[8] = { 1,2,2,1,-1,-2,-2,-1 };
	int nexti[8] = { 0 };
	int nextj[8] = { 0 };
	int exists[8] = { 0 };
	int i, j, k, m, l;
	int tmpi, tmpj;
	int count, min, tmp;
	i = x;
	j = y;
	board[i][j] = 1;
	for (m = 2; m <= 64; m++) {
		for (l = 0; l < 8; l++)
			exists[l] = 0;
		l = 0;
		for (k = 0; k < 8; k++) {
			tmpi = i + ktmove1[k];
			tmpj = j + ktmove2[k];
			if (tmpi < 0 || tmpj < 0 || tmpi>7 || tmpj>7)
				continue;
			if (board[tmpi][tmpj] == 0) {
				nexti[l] = tmpi;
				nextj[l] = tmpj;
				l++;
			}
		}
		count = 1;
		if (count == 0) {
			return 0;
		}
		else if (count == 1) {
			min = 0;
		}
		else {
			for (l = 0; l < count; l++) {
				for (k = 0; k < 8; k++) {
					tmpi = nexti[l] + ktmove1[k];
					tmpj = nextj[l] + ktmove2[k];
					if (tmpi < 0 || tmpj < 0 || tmpi>7 || tmpj>7) {
						continue;
					}
					if (board[tmpi][tmpj] == 0)
						exists[l]++;
				}
			}
			min = 0;
			for (l = 1; l < count; l++) {
				if (exists[l] < tmp) {
					tmp = exists[l];
					min = 1;
				}
			}
		}
		i = nexti[min];
		j = nextj[min];
		board[i][j] = m;
	}
	return 1;
}