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 Solvers21
Suggested Problems
-
Find the sum of all the numbers of the input vector
53739 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2078 Solvers
-
Back to basics 22 - Rotate a matrix
932 Solvers
-
Cell Counting: How Many Draws?
2378 Solvers
-
402 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!