Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Tennenhouse, Craig"'
Autor:
Burke, Kyle, Tennenhouse, Craig
We define a new, partizan, loopy combinatorial game, Forced-Capture Hnefatafl, similar to Hnefatafl, except that players are forced to make capturing moves when available. We show that this game is PSPACE-hard using a reduction from Constraint Logic,
Externí odkaz:
http://arxiv.org/abs/2301.06127
Autor:
Burke, Kyle, Tennenhouse, Craig
We define a new impartial combinatorial game, Flag Coloring, based on flood filling. We then generalize to a graph game, and find values for many positions on two colors. We demonstrate that the generalized game is PSPACE-complete for two colors or m
Externí odkaz:
http://arxiv.org/abs/2212.10631
Autor:
Burke, Kyle, Khovanova, Tanya, Lee, Joshua, Nowakowski, Richard J., Rowland, Amelia, Tennenhouse, Craig
We discuss games involving a counterfeit coin. Given one counterfeit coin among a number of otherwise identical coins, two players with full knowledge of the fake coin take turns weighing coins on a two-pan scale, under the condition that on every tu
Externí odkaz:
http://arxiv.org/abs/2201.04973
Autor:
Burke, Kyle, Tennenhouse, Craig
Publikováno v:
In Theoretical Computer Science 27 July 2024 1006
Autor:
Huggan, Melissa A., Tennenhouse, Craig
Genetic programming is the practice of evolving formulas using crossover and mutation of genes representing functional operations. Motivated by genetic evolution we develop and solve two combinatorial games, and we demonstrate some advantages and pit
Externí odkaz:
http://arxiv.org/abs/2102.00476
Autor:
Tennenhouse, Craig
The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few efforts toward
Externí odkaz:
http://arxiv.org/abs/1905.05033
We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This answers affir
Externí odkaz:
http://arxiv.org/abs/1806.08809
Autor:
Fisher, Michael, Tennenhouse, Craig
Graph Pebbling is a well-studied single-player game on graphs. We introduce the game of Blocking Pebbles which adapts Graph Pebbling into a two-player strategy game in order to examine it within the context of Combinatorial Game Theory. Positions wit
Externí odkaz:
http://arxiv.org/abs/1712.01173
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues, priority queues, sets, linked lists, and binary trees. We describe m
Externí odkaz:
http://arxiv.org/abs/1605.06327