Problem 45433. The Dark Knight
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 commentsProblem Recent Solvers14
Suggested Problems
-
Remove all the words that end with "ain"
2518 Solvers
-
Back to basics 3 - Temp Directory
373 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
561 Solvers
-
Calculate the height of an object dropped from the sky
269 Solvers
-
Fix the last element of a cell array
1637 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!