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 Solvers25
Suggested Problems
-
Return the 3n+1 sequence for n
8528 Solvers
-
320 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1297 Solvers
-
Given a window, how many subsets of a vector sum positive
873 Solvers
-
Convert from Fahrenheit to Celsius
28899 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!