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 Solvers11

Suggested Problems

• Calculate the Levenshtein distance between two strings

  1422 Solvers

• Knight's Tour Checker

  1373 Solvers

• Bit Reversal

  1411 Solvers

• Sum of first n positive integers

  579 Solvers

• Binary

  203 Solvers

More from this Author165

• Dominant Matrix - 01

  24 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

• Count digits

  29 Solvers

• ZigZag - 04

  13 Solvers

• Do they touch?

  20 Solvers