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 Solvers22
Suggested Problems
-
2085 Solvers
-
Check to see if a Sudoku Puzzle is Solved
341 Solvers
-
Find the largest value in the 3D matrix
1677 Solvers
-
Unique values without using UNIQUE function
450 Solvers
-
Find out missing number from a vector of 9 elements
322 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!