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
-
1845 Solvers
-
Find state names that end with the letter A
1198 Solvers
-
All your base are belong to us
579 Solvers
-
2279 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
961 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!