UVA - 439
Description 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 ofn 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 froma to b. Input SpecificationThe 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 chessboard. Output SpecificationFor each test case, print one line saying "To get from xx to yy takes n knight moves.". Sample Inpute2 e4 a1 b2 b2 c3 a1 h8 a1 h7 h8 a1 b1 c3 f6 f6 Sample OutputTo get from e2 to e4 takes 2 knight moves. To get from a1 to b2 takes 4 knight moves. To get from b2 to c3 takes 2 knight moves. To get from a1 to h8 takes 6 knight moves. To get from a1 to h7 takes 5 knight moves. To get from h8 to a1 takes 6 knight moves. To get from b1 to c3 takes 1 knight moves. To get from f6 to f6 takes 0 knight moves. 还不会熟练使用BFS和DFS,这道算是基本的bfs练习题吧。借鉴了别人的代码,终于AC了。
|
习题6-4 骑士的移动 UVa 439
最新推荐文章于 2020-08-04 11:08:41 发布
本文详细探讨了骑士在国际象棋棋盘上的移动方式,结合UVa 439题目,解释了解题思路和算法实现,包括如何计算在限定步数内骑士的所有可能位置。
摘要由CSDN通过智能技术生成