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

• Project Euler: Problem 1, Multiples of 3 and 5

  3677 Solvers

• "Look and say" sequence

  238 Solvers

• Duplicate each element of a vector.

  636 Solvers

• Add a row of zeros on top of a matrix

  268 Solvers

• reverse string

  384 Solvers

More from this Author174

• Sky full of stars - 03

  28 Solvers

• An n-sided regular polygon is drawn within a circle whose radius is 'r', what will be the area of the polygon?

  39 Solvers

• check whether a number is a pentatope number

  65 Solvers

• Chain multiplication - 03

  9 Solvers

• Don't be Too Greedy!!

  9 Solvers