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
-
Find the peak 3n+1 sequence value
2572 Solvers
-
Find state names that start with the letter N
1507 Solvers
-
Back to basics 23 - Triangular matrix
1149 Solvers
-
Simple date to serial no. conversion
134 Solvers
-
1694 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!