ZOJ1091-Knight Moves-DFS

最新推荐文章于 2022-03-18 18:29:12 发布

zjutsunny

最新推荐文章于 2022-03-18 18:29:12 发布

阅读量255

点赞数

分类专栏：算法分析

本文链接：https://blog.csdn.net/zjutsunny/article/details/103012912

版权

算法分析专栏收录该内容

149 篇文章 6 订阅

订阅专栏

#include <stdio.h>
#include <memory.h>

int knight[8][8];
int x[] = {1,1,2,2,-1,-1,-2,-2};
int y[] = {2,-2,1,-1,2,-2,1,-1};

void DFS(int si, int sj, int moves)
{
	if (si<0 || sj<0 || si>=8 || sj>=8 || 
		moves>=knight[si][sj]) return;
	knight[si][sj] = moves;
	int i;
	for (i=0; i<8; i++)
		DFS(si+x[i], sj+y[i], moves+1);
}
	
int main()
{
	char a[10], b[10];
	while(scanf("%s%s", a, b)!=EOF)
	{
		memset(knight, 10, sizeof(knight));
		DFS(a[0]-'a', a[1]-'1', 0);
		printf("To get from %s to %s takes ",a, b);
		printf("%d knight moves.\n", knight[b[0]-'a'][b[1]-'1']);
	}
	return 0;
}