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 Solvers22

Suggested Problems

• Distance walked 2D

  319 Solvers

• given 3 sides, find area of this triangle

  821 Solvers

• frame of the matrix

  928 Solvers

• Area of an Isoceles Triangle

  6172 Solvers

• Return fibonacci sequence do not use loop and condition

  863 Solvers

More from this Author174

• Do they touch?

  25 Solvers

• Sub-sequence - 01

  23 Solvers

• Minimal Path - 01

  15 Solvers

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

  18 Solvers

• Check Digit - 02

  15 Solvers