## Description

**Instruction**

** **

Submit your answer to this question via PC^2 under your account by the posted due time. No late submissions will be accepted. Note that homework is opened-book, but no outside assistance is permitted.

**Problem**

** **

Point(0,0)

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 represented by Point( x1 , y1 ) and Point( x2 , y2 ) as input and then determines the number of knight moves on a shortest route from Point( x1 , y1 ) to Point( x2 , y2 ).

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 (0..7) representing the column and a digit (0..7) representing the row on the chessboard. For each test case, print one line saying “To get from Point( x1 , y1 ) to Point( x2 , y2 ) takes *m* knight moves.”

**Sample input**

** **

4,2,4,4

**Sample output**

** **

To get from Point( 4 , 2 ) to Point( 4 , 4 ) takes 2 knight moves.