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 Solvers19
Suggested Problems
-
Find the sum of the elements in the "second" diagonal
1183 Solvers
-
Back to basics 3 - Temp Directory
380 Solvers
-
352 Solvers
-
Relative ratio of "1" in binary number
1554 Solvers
-
Find last zero for each column
648 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!