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
-
Longest run of consecutive numbers
6459 Solvers
-
691 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
13657 Solvers
-
Calculate the height of an object dropped from the sky
283 Solvers
-
convert matrix to single column
435 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!