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 Solvers21

Suggested Problems

• Find the longest sequence of 1's in a binary sequence.

  6688 Solvers

• Duplicates

  2417 Solvers

• Get the length of a given vector

  13021 Solvers

• Given a matrix, return the last eigen value

  233 Solvers

• Orthonormal matrix

  222 Solvers

More from this Author174

• ZigZag - 04

  14 Solvers

• Area-07

  17 Solvers

• Orthogonal Circles

  13 Solvers

• Exponentiation

  31 Solvers

• Successive zeros

  17 Solvers