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 peak 3n+1 sequence value
2568 Solvers
-
Set some matrix elements to zero
626 Solvers
-
Given a matrix, return the last eigen value
233 Solvers
-
310 Solvers
-
Sum the numbers on the main diagonal
613 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!