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 Solvers24
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5811 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Project Euler: Problem 10, Sum of Primes
2127 Solvers
-
475 Solvers
-
Sum of first n positive integers
627 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!