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
-
2660 Solvers
-
2409 Solvers
-
Matrix with different incremental runs
557 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
841 Solvers
-
ZigZag matrix with reflected format
277 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!