Re: [math-fun] sketched proof of Knight distance formula

Let f(K,L) := the smallest number of knight moves {(+-2,+-1),(+-1,+-2)} it takes to get from square (0,0) to square (K,L) on an infinite chessboard. WLOG assume K,L > 0. Then find an explicit way to express f(K,L), and prove its correctness. --Dan On Apr 12, 2014, at 6:18 AM, David Wilson <davidwwilson@comcast.net> wrote:

I've kind of lost track of this thread. What exactly is the "Knight distance formula" to be proved?