The current position of the knight is x The desired destination is y The size of the chessboard is n.
Find the minimum number of moves required by the knight to reach the destination.
For example,
x=[2,2] y=[3,3] -- moves required = 2 [2,2] > [1,4] > [3,3]
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers25
Suggested Problems
-
Return the largest number that is adjacent to a zero
5542 Solvers
-
2104 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
226 Solvers
-
When can one be the Life Member of the IEEE?
75 Solvers
-
645 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!