def solveable$\_$help$($p$\_$idxs, k$\_$idx,visited$)$:

$"""$Returns True if all pawn locations can be capture by sequential knight moves"""

# $1)$ Base case $-$ is the puzzle solved?

# $2)$ Find all valid$\_$moves

# $3)$ Try all valid$\_$moves

# $4)$ If nothing worked in step $3,$ there's no solution with the knight in this position