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
-
2371 Solvers
-
Renaming a field in a structure array
1578 Solvers
-
Program an exclusive OR operation with logical operators
750 Solvers
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
Calculate the area of a triangle between three points
3420 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!