Peg Solitaire Army problems are based on the game mechanics of peg solitaire (see the corresponding CoG page on Peg Solitaire).
In a solitaire army problem, given a region of a -possibly infinite- board, called desert, and a target position inside the desert, one is asked to find a configuration of pegs outside the desert and a sequence of moves that allows some peg to reach the target position.
In its classical formulation, introduced by J.H. Conway , the desert is a half-plane, and the challenge is to understand what is the farthest distance in the desert that allows the target position to be reached. Conway devised an elegant potential argument to show that distance $5$ cannot be reached on any finite board .
In , the authors investigate infinite desert shapes such as cones and quadrants of an infinite board, and finite desert shapes such as square-shaped and rhombus-shaped deserts in infinite boards, and corners of square boards. For square/rhombus deserts, they consider as natural target position the center of the square/rhombus; their goal is that of finding the largest size of the desert for which the puzzle is solvable. They show that the $9 \times 9$ square-shaped and $13 \times 13$ rhombus-shaped deserts are solvable, while the $13 \times 13$ square-shaped and $17 × 17$ rhombus-shaped are not. In , it was then shown that the $11 \times 11$ square-shaped and $15 \times 15$ rhombus-shaped deserts are also solvable, among other variants of deserts.
 B. Csakany, R. Juhasz, “The Solitaire Army Reinspected,” Mathematics Magazine, 2000.
 L. Gualà, S. Leucci, E. Natale, R. Tauraso, “Large Peg-Army Maneuvers”, in FUN 2016.