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
-
1718 Solvers
-
Is my wife right? Now with even more wrong husband
1348 Solvers
-
10853 Solvers
-
Given a matrix, return the last eigen value
233 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
985 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!