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 Solvers24
Suggested Problems
-
4506 Solvers
-
Arrange Vector in descending order
13867 Solvers
-
Permute diagonal and antidiagonal
516 Solvers
-
Fahrenheit to Celsius converter
610 Solvers
-
find the maximum element of the matrix
542 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!