Algorithm $1$: Movement of Knights

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:

$[$

$]$

$[-2,1],[-1,2],[1,2],[2,1],[2,-1],[1,-2],[-1,-2],[-2,-1]$

A knight is able to capture the other knight when it moves onto the square currently occupied by

the second knight. For each knight, a turn allows only a move. For example, if both knights moved

towards each other once, and then knightA captures knightB on its next move, two turns would

have been used $($even though knightB never made its second move$).$

Design an algorithm that returns the minimum number of turns required before one of the knights

is able to capture the other knight, assuming they are working together to achieve this goal. The

number should be rounded off to the whole number.