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

• Pangrams!

  3997 Solvers

• Making change

  3484 Solvers

• How to find the position of an element in a vector without using the find function

  2814 Solvers

• The sum of the numbers in the vector

  642 Solvers

• Rescale Scores

  7128 Solvers

More from this Author174

• Castling-02

  10 Solvers

• First Duplicate

  10 Solvers

• Take a binary number as input,rearrange it in any manner such that its value is greater than the original one.output should be all the possible values in decimal.

  15 Solvers

• Fault in our Stars - 01

  19 Solvers

• Congruent

  43 Solvers