activity
20152025
most citedTetris Hypergraphs and Combinations of Impartial Games

6 citations · 7 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2025

Row Impartial Terminus

Eric Gottlieb, Dawood Khatana, Matjaž Krnc +2

We introduce Row Impartial Terminus (RIT), an impartial combinatorial game played on integer partitions. We show that any position in RIT can be uniquely decomposed into a core and…

math.CO2022

Sprague-Grundy values and complexity for LCTR

Eric Gottlieb, Matjaž Krnc, Peter Muršič

Given an integer partition of , we consider the impartial combinatorial game LCTR in which moves consist of removing either the left column or top row of its Young diagram. We s…

math.CO2018

Sprague-Grundy Function of Matroids and Related Hypergraphs

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2

We consider a generalization of the classical game of called hypergraph . Given a hypergraph $\cH$ on the ground set of piles of stones, two p…

math.CO2018

Sprague-Grundy Function of Symmetric Hypergraphs

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2

We consider a generalization of the classical game of called hypergraph . Given a hypergraph $\cH$ on the ground set of piles of stones, two p…

math.CO2017★ 6 cited

Tetris Hypergraphs and Combinations of Impartial Games

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2

The Sprague-Grundy (SG) theory reduces the sum of impartial games to the classical game of . We generalize the concept of sum and introduce $\cH$-combinations of impartial gam…

math.CO2015★ 1 cited

On the Sprague-Grundy function of Exact -Nim

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2

Moore's generalization of the game of {\sc Nim} is played as follows. Let and be two integers such that . Given piles of tokens, two players move alter…