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
-
2543 Solvers
-
992 Solvers
-
Back to basics 22 - Rotate a matrix
929 Solvers
-
Getting the row and column location from a matrix
297 Solvers
-
Find the next Fibonacci number
893 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!