Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Huntemann, Svenja"'
Autor:
Huntemann, Svenja, Maciosowski, Tomasz
Domineering is a partizan game where two players have a collection of dominoes which they place on the grid in turn, covering up squares. One player places tiles vertically, while the other places them horizontally; the first player who cannot move l
Externí odkaz:
http://arxiv.org/abs/2408.16095
Autor:
Huntemann, Svenja, Maciosowski, Tomasz
Snort is a two-player game played on a simple graph in which players alternately colour a vertex such that they do not colour adjacent to their opponents' vertex. In combinatorial game theory, the temperature of a position is a measure of the urgency
Externí odkaz:
http://arxiv.org/abs/2406.02107
In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we consider supersta
Externí odkaz:
http://arxiv.org/abs/2403.04955
Autor:
Huntemann, Svenja, Nash, Lexi A.
Distance games are games played on graphs in which the players alternately colour vertices, and which vertices can be coloured only depends on the distance to previously coloured vertices. The polynomial profile encodes the number of positions with a
Externí odkaz:
http://arxiv.org/abs/2111.09349
We introduce an impartial combinatorial game on Steiner triple systems called Nofil. Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. We explore the play of Nofil on all S
Externí odkaz:
http://arxiv.org/abs/2103.13501
Autor:
Huntemann, Svenja, McKay, Neil A.
Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of each player's
Externí odkaz:
http://arxiv.org/abs/1909.12419
Autor:
Huntemann, Svenja
The legal positions of a strong placement game, such as Domineering, form a simplicial complex called the legal complex. In this paper, we use the legal complex to study the game values taken on by the class of strong placement games using the legal
Externí odkaz:
http://arxiv.org/abs/1908.10182
For combinatorial games, temperature is a measure of the volatility, that is, by how much the advantage can change. Typically, the temperature has been measured for individual positions within specific games. In this paper, we give the first general
Externí odkaz:
http://arxiv.org/abs/1908.08471
Strong placement games (SP-games) are a class of combinatorial games whose structure allows one to describe the game via simplicial complexes. A natural question is whether well-known invariants of combinatorial games, such as "game value", appear as
Externí odkaz:
http://arxiv.org/abs/1608.05629
We study the computational complexity of distance games, a class of combinatorial games played on graphs. A move consists of colouring an uncoloured vertex subject to it not being at certain distances determined by two sets, D and S. D is the set of
Externí odkaz:
http://arxiv.org/abs/1605.06801