Maximum Number of Moves to Kill All Pawns

Players alternately choose and capture a remaining pawn with the knight using the minimal number of knight moves from its current position, where Alice aims to maximize and Bob to minimize the total moves until all pawns are gone. The core challenge is to precompute shortest knight-move distances between the knight and pawns (and between pawns) and then solve an alternating-player optimal-ordering problem via minimax dynamic programming over subsets.