Rational Heap Games

We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$,where$p_1q_2 > q_1p_2$,$p_1>0$and$q_2>0$, two players alternate in removing $(m_1,m_2)\mathrm{\ne }(0,0)$ tokens from the respective heaps, where the allowed ordered pairs of non-negative integers are given by a certain move set $(m_1,m_2)\in \text{M}$. There is a restriction imposed on the allowed heap sizes $(X, Y)$,theymustsatisfy$Xq_1\le Yp_1$and$Yp_2\le Xq_2$. A player who cannot move loses and the other player wins. For a certain restriction of these games, namely where each allowed move option $(m_1,m_2)$ is of the form $(s{p}_1+t{p}_2,s{q}_1+t{q}_2)$, for some ordered pair of non-negative integers $(s,t)\mathrm{\ne }(0,0)$, we show that all games have equivalent outcomes via a certain surjective map to a canonical subtraction game. Other interests in our games are various interactions with classical combinatorial games such as \emph{Nim} and \emph{Wythoff Nim}.