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
-
14380 Solvers
-
Read a column of numbers and interpolate missing data
2356 Solvers
-
505 Solvers
-
Matrix which contains the values of an other matrix A at the given locations.
240 Solvers
-
The sum of the numbers in the vector
649 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!