Summary: We study operators that combine combinatorial games. This field was initiated by Sprague-Grundy (1930s), Milnor (1950s) and Berlekamp-Conway-Guy (1970-80s) via the now classical disjunctive sum operator on (abstract) games. The new class consists in operators for rulesets, dubbed the switch-operators. The ordered pair of rulesets \((\mathcal{R}_1, \mathcal{R}_2)\) is compatible if, given any position in \(\mathcal{R}_1\), there is a description of how to move in \(\mathcal{R}_2\). Given compatible \((\mathcal{R}_1, \mathcal{R}_2)\), we build the push-the-button game \(\mathcal{R}_1 \circledcirc \mathcal{R}_2\), where players start by playing according to the rules \(\mathcal{R}_1\), but at some point during play, one of the players must switch the rules to \(\mathcal{R}_2\), by pushing the button ’. Thus, the game ends according to the terminal condition of ruleset \(\mathcal{R}_2\). We study the pairwise combinations of the classical rulesets Nim, Wythoff and Euclid. In addition, we prove that standard periodicity results for Subtraction games transfer to this setting, and we give partial results for a variation of Domineering, where \(\mathcal{R}_1\) is the game where the players put the domino tiles horizontally and \(\mathcal{R}_2\) the game where they play vertically (thus generalizing the octal game 0.07).