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
-
2532 Solvers
-
394 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2580 Solvers
-
Unique values without using UNIQUE function
454 Solvers
-
There are 10 types of people in the world
1380 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!