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
-
24256 Solvers
-
Back to basics 22 - Rotate a matrix
939 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
977 Solvers
-
Sum the 'edge' values of a matrix
416 Solvers
-
Convert given decimal number to binary number.
2379 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!