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
-
110685 Solvers
-
Return a list sorted by number of occurrences
2842 Solvers
-
Create a Multiplication table matrix...
682 Solvers
-
Calculate the height of an object dropped from the sky
271 Solvers
-
Vector of numbers divisible by 3
149 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!