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 Solvers26
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5823 Solvers
-
Find state names that start with the letter N
1514 Solvers
-
Similar Triangles - find the height of the tree
479 Solvers
-
989 Solvers
-
There are 10 types of people in the world
1411 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!