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.

Card game | Rating: 4.00
Posted on 2006-08-12 by atheron (No Solution Yet, 10 Comments)

Darting on one leg |
Posted on 2006-06-22 by Dej Mar (Solution Posted, 5 Comments)

The Ultimate Cribbage Hand | Rating: 3.33
Posted on 2006-06-07 by Jer (Solution Posted, 21 Comments)

An Occupied And Vacant Squares Problem | Rating: 2.50
Posted on 2006-03-19 by K Sengupta (Solution Posted, 4 Comments)

Scrabble® Scramble | Rating: 4.00
Posted on 2006-02-03 by Vernon Lewis (Solution Posted, 8 Comments)

Challenging Chess Championship | Rating: 3.33
Posted on 2005-11-16 by Old Original Oskar! (Solution Posted, 13 Comments)

The Dice Game | Rating: 3.67
Posted on 2005-11-04 by Gamer (Solution Posted, 12 Comments)