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 Solvers23

Suggested Problems

• Given an unsigned integer x, find the largest y by rearranging the bits in x

  2055 Solvers

• Reverse the vector

  16873 Solvers

• Vectorize the digits of an Integer

  338 Solvers

• Sum the elements in either diagonal of a square matrix

  222 Solvers

• Reverse Calculator

  206 Solvers

More from this Author174

• Check Digit - 02

  16 Solvers

• Castling-01

  17 Solvers

• Last Digit of fibonacci number

  29 Solvers

• Grazing-02

  11 Solvers

• Capitalize

  27 Solvers