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

• Pi Estimate 1

  1768 Solvers

• Change the sign of even index entries of the reversed vector

  643 Solvers

• Decimation

  307 Solvers

• Sum of first n positive integers

  622 Solvers

• Length of the hypotenuse

  16387 Solvers

More from this Author174

• Hanging cable - 01

  9 Solvers

• Can the knight take out the pawn?

  14 Solvers

• How many ways?

  20 Solvers

• Queen's move

  17 Solvers

• Minimal Path - 03

  9 Solvers