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

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

  6802 Solvers

• Woodall number

  173 Solvers

• Nilpotent matrix

  318 Solvers

• Getting the absolute index from a matrix

  259 Solvers

• Find nth maximum

  936 Solvers

More from this Author174

• Yoonir - 01

  25 Solvers

• Checkmate-02

  11 Solvers

• Summing Rows and Columns

  61 Solvers

• generate the matrix

  37 Solvers

• Kissing Circles-01

  18 Solvers