HDU-1372,Knight Moves(BFS)

简介: HDU-1372,Knight Moves(BFS)

Problem 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 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.


Input:


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 chessboard.  


Output:


For each test case, print one line saying "To get from xx to yy takes n knight moves.".


Sample Input:


e2 e4


a1 b2


b2 c3


a1 h8


a1 h7


h8 a1


b1 c3


f6 f6



Sample Output:


To get from a1 to b2 takes 4 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.


程序代码:



相关文章
|
7月前
|
机器学习/深度学习 安全 Java
hdu-1596-find the safest road(dijkstra)
hdu-1596-find the safest road(dijkstra)
49 0
|
7月前
Knight Moves(POJ2243)
Knight Moves(POJ2243)
|
算法
1091 zoj Knight Moves的BFS算法和DFS
1091 zoj Knight Moves的BFS算法和DFS
66 0
AtCoder Beginner Contest 176 D - Wizard in Maze(01BFS)
AtCoder Beginner Contest 176 D - Wizard in Maze(01BFS)
119 0
UVA439-骑士的移动 Knight Moves(BFS)
UVA439-骑士的移动 Knight Moves(BFS)
UVA439-骑士的移动 Knight Moves(BFS)
POJ-2488,A Knight's Journey(DFS)
POJ-2488,A Knight's Journey(DFS)
|
算法 Go
HDU-1548,A strange lift(Dijkstra)
HDU-1548,A strange lift(Dijkstra)
HDOJ/HDU 1372 Knight Moves(经典BFS)
HDOJ/HDU 1372 Knight Moves(经典BFS)
138 0
|
测试技术
Knight Moves(骑士移动) (bfs) POJ-2243
题目:Knight Moves (骑士移动)