The relative positions of two knight pieces on a chess board are given to you. The position of each

knight is given as a list of $2$ values, the $$ and $$ coordinates. A knight can make $1$ of $8$ possible

moves on any given turn. Each of these moves involves moving in an $"$L$"$ shape. This means they

can either move $2$ squares horizontally and $1$ square vertically, or they can move $1$ square

horizontally and $2$ squares vertically. For example, if a knight is currently at position $[0,0],$ then

it can move to any of these $8$ locations on its next move: