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
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
1663 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
222 Solvers
-
272 Solvers
-
Number of Even Elements in Fibonacci Sequence
1637 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!