REVIEW 1 cited by
Game positions of Multiple Hook Removing Game
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Multiple Hook Removing Game (MHRG for short) is an impartial game played in terms of Young diagrams. In this paper, we give a characterization of the set of all game positions in MHRG. As an application, we prove that for $t \in \mathbb{Z}_{\geq 0}$ and $m, n \in \mathbb{N}$ such that $t \leq m \leq n$, and a Young diagram $Y$ contained in the rectangular Young diagram $Y_{t,n}$ of size $t \times n$, $Y$ is a game position in MHRG with $Y_{m,n}$ the starting position if and only if $Y$ is a game position in MHRG with $Y_{t,n-m+t}$ the starting position, and also that the Grundy value of $Y$ in the former MHRG is equal to that in the latter MHRG.
Forward citations
Cited by 1 Pith paper
-
Nim on Integer Partitions and Hyperrectangles
Exact Sprague-Grundy formulas are proven for two new impartial games, PNim on Young diagrams and RNim on hyperrectangles, with a full description of partitions of value one.
Discussion (0). Continue with ORCID to comment.