Function kmf(x,y) is the minimum number of moves for a knight to move x units to the right and y units forward.

(1) Find kmf(x,y) for non-negative integer values of x and y from 0 to 7.
(2) Can you find an expression for kmf(x,y) in terms of x and y?

Notes:
Assume this is an infinite chess board so there are no edge-of-the-board boundary issues.
To avoid duplication, ignore cases where y is less than x.

Prisoner's Dilemma | Rating: 3.00
Posted on 2005-10-06 by Gamer (No Solution Yet, 11 Comments)

Reconstruct this chess game | Rating: 3.50
Posted on 2005-08-29 by pcbouhid (Solution Posted, 10 Comments)

What´s your score? | Rating: 4.50
Posted on 2005-07-30 by pcbouhid (Solution Posted, 39 Comments)

Ripley's IQ Game | Rating: 4.00
Posted on 2005-07-23 by brianjn (Solution Posted, 17 Comments)

There is something missing | Rating: 4.40
Posted on 2005-05-13 by Hugo (Solution Posted, 29 Comments)

Pool Ball | Rating: 4.00
Posted on 2005-04-28 by Juggler (No Solution Yet, 16 Comments)

Only One Hand | Rating: 4.29
Posted on 2005-04-11 by David Shin (Solution Posted, 31 Comments)

Knight vs King and Mines | Rating: 4.00
Posted on 2005-03-07 by Federico Kereki (Solution Posted, 15 Comments)