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 Solvers14

Suggested Problems

• Longest Divisor Run

  1342 Solvers

• Back to basics 4 - Search Path

  373 Solvers

• Matrix with different incremental runs

  546 Solvers

• Create an n-by-n null matrix and fill with ones certain positions

  661 Solvers

• Reverse a matrix

  536 Solvers

More from this Author174

• Lost days

  60 Solvers

• Repeat elements of a vector

  51 Solvers

• Number of leaps in binary search

  9 Solvers

• Chain multiplication - 03

  9 Solvers

• Dominant Matrix - 02

  6 Solvers