We present take-away games whose Sprague-Grundy functions are given by the Nim sum of heap sizes in a mixed base $β$. Let $Δ_β$ be the set of such games. We give a necessary and sufficient condition for the existence of a minimum of $Δ_β$, and a recursive construction of the maximum of $Δ_β$.