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 comments
Loading...
Problem Recent Solvers21
Suggested Problems
-
Return the largest number that is adjacent to a zero
5516 Solvers
-
21063 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2538 Solvers
-
246 Solvers
-
Who knows the last digit of pi?
691 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!