Tetris Hypergraphs and Combinations of Impartial Games

MaRDI QIDQ6281774zbMATH OpenFDO

Authors Endre Boros, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic

Publication date 10 January 2017

Abstract: The Sprague-Grundy (SG) theory reduces the sum of impartial games to the classical game of $NIM$. We generalize the concept of sum and introduce $cH$-combinations of impartial games for any hypergraph $cH$. In particular, we introduce the game $NI{M}_{c}H$ which is the $cH$-combination of single pile $NIM$ games. An impartial game is called SG decreasing if its SG value is decreased by every move. Extending the SG theory, we reduce the $cH$-combination of SG decreasing games to $NI{M}_{c}H$. We call $cH$ a Tetris hypergraph if $NI{M}_{c}H$ is SG decreasing. We provide some necessary and some sufficient conditions for a hypergraph to be Tetris.

This page was built for publication: Tetris Hypergraphs and Combinations of Impartial Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281774)