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

• Times 2 - START HERE

  113323 Solvers

• Binary numbers

  4774 Solvers

• Least common multiple of many numbers

  255 Solvers

• letter yes yes & letter no no

  538 Solvers

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

  399 Solvers

More from this Author174

• Sky full of stars - 01

  26 Solvers

• Frugal number

  50 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

• Can the knight take out the pawn?

  14 Solvers

• Chain multiplication - 01

  28 Solvers