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
-
Sum of diagonal of a square matrix
1637 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
222 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
683 Solvers
-
Golomb's self-describing sequence (based on Euler 341)
183 Solvers
-
Rounding off numbers to n decimals
5523 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!