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]
Solve

Solution Stats

53 Solutions

22 Solvers

Last Solution submitted on Apr 27, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers22

George Berken Marco Riani Armando Longobardi Kailyn Montez

Suggested Problems

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!