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.

  6697 Solvers

• Unique values without using UNIQUE function

  446 Solvers

• Say something funny

  743 Solvers

• Who has power to do everything in this world?

  486 Solvers

• find the maximum element of the matrix

  538 Solvers

More from this Author174

• Minimal Path - 02

  11 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

• Zero

  25 Solvers

• Fibonacci Word

  23 Solvers

• Jump Search - 01

  8 Solvers