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 Solvers26

Suggested Problems

• Find the longest sequence of 1's in a binary sequence.

  6866 Solvers

• Poker Series 01: isStraightFlush

  127 Solvers

• Back to basics 11 - Max Integer

  812 Solvers

• MATCH THE STRINGS (2 CHAR) very easy

  301 Solvers

• select the primes of a vector

  323 Solvers

More from this Author174

• Gapful numbers

  21 Solvers

• Take it out

  19 Solvers

• Lost days

  68 Solvers

• Hanging cable - 02

  12 Solvers

• Sub-sequence - 03

  19 Solvers