For any i<16, j<16, the (16*i+j)th number in the following array is the minimum number of knight moves necessary to get from position i to position j. Here, the position of grid location (row, column) is defined to be 4*row+column. 0 3 2 5 3 4 1 2 2 1 4 3 5 2 3 2 3 0 3 2 2 3 2 1 1 2 1 4 2 3 2 3 2 3 0 3 1 2 3 2 4 1 2 1 3 2 3 2 5 2 3 0 2 1 4 3 3 4 1 2 2 3 2 5 3 2 1 2 0 3 2 3 3 2 1 2 2 1 4 3 4 3 2 1 3 0 3 2 2 3 2 1 1 2 1 4 1 2 3 4 2 3 0 3 1 2 3 2 4 1 2 1 2 1 2 3 3 2 3 0 2 1 2 3 3 4 1 2 2 1 4 3 3 2 1 2 0 3 2 3 3 2 1 2 1 2 1 4 2 3 2 1 3 0 3 2 4 3 2 1 4 1 2 1 1 2 3 2 2 3 0 3 1 2 3 4 3 4 1 2 2 1 2 3 3 2 3 0 2 1 2 3 5 2 3 2 2 1 4 3 3 4 1 2 0 3 2 5 2 3 2 3 1 2 1 4 2 3 2 1 3 0 3 2 3 2 3 2 4 1 2 1 1 2 3 2 2 3 0 3 2 3 2 5 3 4 1 2 2 1 4 3 5 2 3 0