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.

Fifteen | Rating: 1.00
Posted on 2013-05-13 by brianjn (No Solution Yet, 2 Comments)

Colorful Win |
Posted on 2013-05-02 by K Sengupta (No Solution Yet, 4 Comments)

Fifteen Frolic |
Posted on 2013-02-12 by K Sengupta (No Solution Yet, 2 Comments)

Solitaire |
Posted on 2012-10-02 by brianjn (Solution Posted, 6 Comments)

Checkers Run |
Posted on 2012-04-01 by brianjn (No Solution Yet, 0 Comments)

5-by-5 Square Tic-Tac-Toe | Rating: 4.00
Posted on 2012-01-26 by Dustin (No Solution Yet, 7 Comments)

A binary enigma |
Posted on 2011-01-21 by Ady TZIDON (No Solution Yet, 5 Comments)

A square question | Rating: 3.00
Posted on 2010-10-12 by Ady TZIDON (Solution Posted, 2 Comments)