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
-
Return a list sorted by number of occurrences
2902 Solvers
-
Are all the three given point in the same line?
609 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
14558 Solvers
-
Reverse the elements of an array
1146 Solvers
-
Sum of diagonals elements of a matrix
235 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!