  The study of the combinatorial game Nim and its variants is rich and varied,
but little is known of the game Nim with a Pass. It is Nim, but once per game a
player is permitted to skip their turn but this can only be done if a nonempty
pile remains. In this paper we define a new binary operation on games which we
use to prove novel properties of Nim with a Pass, as well as games which are
generalizations of it. Most importantly, we make small progress on finding the
$\mathcal{P}$-positions and optimal strategies of the game.
