3 research outputs found
On Remoteness Functions of Exact Slow -NIM with Piles
Given integer and such that and piles of stones,
two player alternate turns. By one move it is allowed to choose any piles
and remove exactly one stone from each. The player who has to move but cannot
is the loser. Cases and are trivial. For the game was
solved for . For the Sprague-Grundy function was
efficiently computed (for both the normal and mis\`ere versions). For
a polynomial algorithm computing P-positions was obtained. Here we consider the
case and compute Smith's remoteness function, whose even
values define the P-positions. In fact, an optimal move is always defined by
the following simple rule: if all piles are odd, keep a largest one and reduce
all other; if there exist even piles, keep a smallest one of them and reduce
all other. Such strategy is optimal for both players, moreover, it allows to
win as fast as possible from an N-position and to resist as long as possible
from a P-position.Comment: 20 page
Sprague-Grundy function of matroids and related hypergraphs
We consider a generalization of the classical game of called hypergraph
. Given a hypergraph \cH on the ground set of
piles of stones, two players alternate in choosing a hyperedge H \in \cH and
strictly decreasing all piles . The player who makes the last move is
the winner. In this paper we give an explicit formula that describes the
Sprague-Grundy function of hypergraph for several classes of hypergraphs.
In particular we characterize all -uniform hypergraphs (that is graphs) and
all matroids for which the formula works. We show that all self-dual matroids
are included in this class