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
-
Find state names that start with the letter N
1445 Solvers
-
How to find the position of an element in a vector without using the find function
2815 Solvers
-
Project Euler: Problem 5, Smallest multiple
1653 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1386 Solvers
-
Make a random, non-repeating vector.
11278 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!