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

• Return the 3n+1 sequence for n

  8488 Solvers

• vectorization in N

  285 Solvers

• Generate a string like abbcccddddeeeee

  274 Solvers

• Create matrix of replicated elements

  397 Solvers

• Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]

  398 Solvers

More from this Author174

• Hanging cable - 02

  9 Solvers

• Yoonir - 01

  24 Solvers

• Area-02

  42 Solvers

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

  38 Solvers

• find nth even fibonacci number

  90 Solvers