---------- Forwarded message ---------- From: Harish Ravichandran <[email protected]> Date: Sun, Jul 31, 2011 at 4:23 PM Subject: how 2 solve......... To: [email protected], [email protected], [email protected]
In a chessboard the initial and final positions of Knight are given. Write a program to find the shortest number of knight moves required to reach the final position from the given initial position. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
