本文介绍了一个编程挑战，目标是编写一个程序来解决旅行骑士问题（TKP），即在给定的棋盘上找出从一个方格到另一个方格的最短骑士移动路径。作者使用了广度优先搜索（BFS）算法来计算两点之间的最少骑士移动次数。
题目描述
A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy.
Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part.
Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b.
输入
The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboa
扫一扫
470
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
