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 sum of all the numbers of the input vector

  53872 Solvers

• Which values occur exactly three times?

  5238 Solvers

• "Look and say" sequence

  235 Solvers

• Find the biggest empty box

  501 Solvers

• Fahrenheit to Celsius converter

  599 Solvers

More from this Author174

• chess position

  16 Solvers

• Don't be Greedy!

  17 Solvers

• Spiral Out - 01

  21 Solvers

• Sky full of stars - 03

  28 Solvers

• Decimal to binary conversion (without using built-in function)

  17 Solvers