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.

Optimal Card Drawing Strategy | Rating: 4.33
Posted on 2010-09-07 by Daniel (Solution Posted, 7 Comments)

Successive Stones Settlement | Rating: 5.00
Posted on 2010-05-03 by K Sengupta (Solution Posted, 2 Comments)

3x4 Knight Swap | Rating: 5.00
Posted on 2010-02-13 by K Sengupta (Solution Posted, 6 Comments)

The Red Stack | Rating: 3.50
Posted on 2009-12-04 by Brian Smith (No Solution Yet, 2 Comments)

3x3 Nim | Rating: 4.00
Posted on 2009-06-25 by Jer (Solution Posted, 26 Comments)

Knights' Tours - Long & Short | Rating: 4.00
Posted on 2009-05-05 by brianjn (Solution Posted, 7 Comments)

Two players, two pots | Rating: 2.00
Posted on 2009-02-21 by pcbouhid (Solution Posted, 3 Comments)