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.

 x=[2,2]  y=[3,3] -- moves required = 2  
   [2,2] > [1,4] > [3,3]

Solution Comments

Problem Recent Solvers12

Suggested Problems

• Renaming a field in a structure array

  1549 Solvers

• Vectorize the digits of an Integer

  325 Solvers

• Area of an Isoceles Triangle

  5679 Solvers

• most frequent character

  156 Solvers

• Convert given decimal number to binary number.

  2112 Solvers

More from this Author165

• Fun with matrix

  24 Solvers

• Can the knight take out the pawn?

  12 Solvers

• Game of life - 01

  12 Solvers

• One-hot encoding

  34 Solvers

• MinMax mapping

  22 Solvers