Some results on LCTR, an impartial game on partitions

Abstract: We apply the Sprague-Grundy Theorem to LCTR, a new impartial game on partitions in which players take turns removing either the Left Column or the Top Row of the corresponding Young diagram. We establish that the Sprague-Grundy value of any partition is at most $2$, and determine Sprague-Grundy values for several infinite families of partitions. Finally, we devise a dynamic programming approach which, for a given partition $\lambda$ of $n$, determines the corresponding Sprague-Grundy value in $O(n)$ time.