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.

Step right up! |
Posted on 2015-09-09 by Jer (No Solution Yet, 1 Comments)

Tax Collector |
Posted on 2015-05-26 by Ady TZIDON (Solution Posted, 6 Comments)

What price glory? |
Posted on 2015-01-22 by Ady TZIDON (No Solution Yet, 5 Comments)

Leonardo's game |
Posted on 2014-06-27 by Ady TZIDON (No Solution Yet, 3 Comments)

Define winning strategy |
Posted on 2013-11-14 by Ady TZIDON (No Solution Yet, 6 Comments)

Coin Toss |
Posted on 2013-06-13 by brianjn (Solution Posted, 4 Comments)

Mirrored Moves | Rating: 5.00
Posted on 2013-05-23 by K Sengupta (Solution Posted, 1 Comments)