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
-
Find the two most distant points
2953 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1268 Solvers
-
Project Euler: Problem 5, Smallest multiple
1651 Solvers
-
Replace multiples of 5 with NaN
468 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
908 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!