37 citations · 40 across the 12 of their papers we have counts for
15 papers
PArcK trees can get as hot as you want
Svenja Huntemann, Neil A. McKay, Craig Tennenhouse
We consider the combinatorial game Partizan Arc Kayles as a generalization of Domineering. An extensive technical search using genetic algorithms found hot positions of temperature…
Minimal Graph Embeddings via Point Deletions in Steiner triple systems
Melissa A. Huggan, Svenja Huntemann, Brett Stevens
The game Nofil is a two-player combinatorial game in which players take turns marking points of a design such that the set of marked points does not contain a block. Equivalently,…
Snort Played on Triangular Grids
Melanie Gauthier, Svenja Huntemann
Snort is a two-player game played on a simple graph in which the players take turns colouring vertices in their own colour, with the restriction that two adjacent vertices cannot h…
High Temperature Domineering Positions
Svenja Huntemann, Tomasz Maciosowski
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…
Degrees are Useless in SNORT When Measuring Temperature
Svenja Huntemann, Tomasz Maciosowski
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…
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers
Kyle Burke, Matthew Ferland, Svenja Huntemann +1
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 in…
The Polynomial Profile of Distance Games on Paths and Cycles
Svenja Huntemann, Lexi A. Nash
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 v…
The combinatorial game nofil played on Steiner Triple Systems
Melissa A. Huggan, Svenja Huntemann, Brett Stevens
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…
Counting Domineering Positions
Svenja Huntemann, Neil A. McKay
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 polyno…
Game Values of Strong Placement Games
Svenja Huntemann
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 v…
Bounding Game Temperature Using Confusion Intervals
Svenja Huntemann, Richard J. Nowakowski, Carlos Pereira dos Santos
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 posi…
Simplicial Complexes are Game Complexes
Sara Faridi, Svenja Huntemann, Richard J. Nowakowski
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-kn…
Enhancing semantic expressivity in the cultural heritage domain: exposing the Zeri Photo Archive as Linked Open Data
Marilena Daquino, Francesca Mambelli, Silvio Peroni +2
Describing cultural heritage objects from the perspective of Linked Open Data (LOD) is not a trivial task. The process often requires not only choosing pertinent ontologies, but al…
Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds
Sara Faridi, Svenja Huntemann, Richard J. Nowakowski
A strong placement game played on a board is equivalent to a simplicial complex . We look at weight games, a subclass of strong placement games, and introduce uppe…
Games and Complexes I: Transformation via Ideals
Sara Faridi, Svenja Huntemann, Richard J. Nowakowski
Placement games are a subclass of combinatorial games which are played on graphs. We will demonstrate that one can construct simplicial complexes corresponding to a placement game,…