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
-
Back to basics 8 - Matrix Diagonals
966 Solvers
-
Create a vector whose elements depend on the previous element
787 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
867 Solvers
-
18028 Solvers
-
Mysterious digits operation (easy)
316 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!