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 Solvers23
Suggested Problems
-
6989 Solvers
-
Create a cell array out of a struct
2564 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
767 Solvers
-
1462 Solvers
-
Circular Primes (based on Project Euler, problem 35)
655 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!