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

56 Solutions

25 Solvers

Last Solution submitted on Jul 24, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...