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 Solvers9
Suggested Problems
-
Arrange vector in ascending order
759 Solvers
-
Find out missing number from a vector of 9 elements
290 Solvers
-
Back to basics - mean of corner elements of a matrix
398 Solvers
-
496 Solvers
-
Change the first and last diagonal element of the identity matrix to zero
146 Solvers
More from this Author165
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!