Cody

Problem 45433. The Dark Knight

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

83.33% Correct | 16.67% Incorrect
Last Solution submitted on May 24, 2020

Problem Recent Solvers2

Suggested Problems

More from this Author145

Problem Tags

chess