Va Knight Moves

The questions are as follows:

Knight Moves

A friend of you is doing research onTraveling Knight Problem (TKP)Where you are to find the shortest closed tour of knight moves that visits each square of a given setNSquares 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 accomplishedthis, finding the tour wocould 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 squaresAAndBAs input and then determines the number of knight moves on a shortest route fromAToB.

Input Specification

The input file will contain in one or more test cases. Each test case consists of one line containing twosquares separated by one space. A square is a string consisting of a letter (A-h) Representing thecolumn and a digit (1-8) Representing the row on the chessboard.

Output Specification

For each test case, print one line saying"To get fromXxToYyTakesNKnight moves.".

Sample Input

e2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6

Sample Output

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

Simulate the progress of the horse in the chess game, and find the shortest path length from the chess point to the other point. Simple wide search 1A...

The AC code is as follows: