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
-
Read a column of numbers and interpolate missing data
2350 Solvers
-
given 3 sides, find area of this triangle
820 Solvers
-
Get the length of a given vector
13124 Solvers
-
Make a run-length companion vector
658 Solvers
-
There are 10 types of people in the world
1289 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!