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

71.43% Correct | 28.57% Incorrect
Last Solution submitted on Aug 14, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers8

Suggested Problems

More from this Author165

Problem Tags

chess

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!