  Alpern's Caching Game is played by $2$ players. Player $1$ is a squirrel, who
is hiding his $d$ nuts in $n$ different holes, with the restriction that he can
only dig down a distance of $1$ metre altogether. After that, Player $2$ wants
to find all the nuts, and she is allowed to dig down a distance of $k$ metres
altogether. Player $2$ wins after finding all the nuts, if she fails then the
squirrel wins. We investigate a discrete version of the game, finding
strategies and statements for both smaller and general values of $n,d,k$. In
particular, we answer a question of P\'alv\"olgyi, by exhibiting an example,
where the value of the game can change depending on which nut the squirrel
reveals, when he has multiple options in the discrete game. We also investigate
and invent other continuous versions of the game, one of them having a
connection to the Manickam-Mikl\'os-Singhi Conjecture.
