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
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
1220 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
583 Solvers
-
351 Solvers
-
Find last zero for each column
696 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!