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 Solvers20
Suggested Problems
-
Convert from Base 10 to base 5
280 Solvers
-
Matrix which contains the values of an other matrix A at the given locations.
239 Solvers
-
How long do each of the stages of the rocket take to burn?
442 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1251 Solvers
-
Is this triangle right-angled?
6512 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!