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
-
Find the two most distant points
2949 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1988 Solvers
-
Increment a number, given its digits
681 Solvers
-
Return the first and last characters of a character array
11791 Solvers
-
Generate a random matrix A of (1,-1)
400 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!