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
-
Replace NaNs with the number that appears to its left in the row.
3069 Solvers
-
359 Solvers
-
Replace multiples of 5 with NaN
472 Solvers
-
How long do each of the stages of the rocket take to burn?
557 Solvers
-
Solve a System of Linear Equations
14817 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!