NAKANJ  Minimum Knight moves !!!
Anjali and Nakul are good friends. They both had a quarrel recently while playing chess. Nakul wants to know the minimum number of moves a knight takes to reach from one square to another square of a chess board (8X8). Nakul is brilliant and he had already written a program to solve the problem. Nakul wants to know whether Anjali can do it. Anjali is very weak in programming. Help her to solve the problem.
A knight can move in the shape of an "L" in a chessboard  two squares either forward, backward, left, or right and then one square to its left or right. A knight move is valid if it moves as mentioned above and it is within the boundary of the chessboard (8 X 8).
Input
There are T test cases in total. The next T lines contain two strings (start and destination) separated by a space.
The strings start and destination will only contain two characters  First character is an alphabet between 'a' and 'h' (inclusive), Second character is a digit between '1' and '8' (inclusive)  (Quotes just for clarity).
To know the knight moves more clearly refer to the above figure.
Output
Print the minimum number of moves a knight takes to reach from start to destination in a separate line.
Constarints
1 <= T <= 4096
Example
Input: 3 a1 h8 a1 c2 h8 c3 Output: 6 1 4
hide comments
crawler_123:
20210426 23:16:50
can use alias like this(key : value pair) {{a: 1},{b: 2},{c: 3},{d: 4},{e: 5},{f: 6},{g: 7},{h: 8}} 

sanchit2812:
20210416 21:42:36
TEST CASES not good. As from x = 4, y = 4 to x = 4 y = 4. ans is 0. But my code were failing but still got accepted. 

swarna1214:
20210401 08:42:29
Why am I getting WA? My code seems to give right answers. Please help me. 

swarna1214:
20210331 07:58:11
I am getting tle again and again. Can someone please help me to fix the issue?


om_37:
20210205 14:38:50
AC in one go..very nice problem for learning 

tinedis740:
20210131 22:15:05
I this this problem only allows C and Cpp.


sma5nico:
20201221 15:57:46
Great problem! Last edit: 20201223 03:30:47 

tarun_28:
20201006 23:00:37
BFS with queue of pairs;) 

shubhamnitt:
20201003 22:51:02
int dx[]={2,2,2,2,1,1,1,1};


fighter_17:
20200917 10:57:22
@tj2972001 
Added by:  Nakul Krishna 
Date:  20120930 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Used for Code it  Vidyut 2012  Amrita University 