Related papers: All passable games are realizable as monotone set …
We develop a theory of combinatorial games that is appropriate for describing positions in Hex and other monotone set coloring games. We consider two natural conditions on such games: a game is monotone if all moves available to both…
A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is…
Rex, short for Reverse Hex, is a set coloring game in which players try to avoid connecting terminals of their color. Combinatorial game theory (CGT) is the study of perfect strategy games. Until recently, both Rex and Hex were not examined…
Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…
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…
Game coloring is a well-studied two-player game in which each player properly colors one vertex of a graph at a time until all the vertices are colored. An `eternal' version of game coloring is introduced in this paper in which the vertices…
We present a definition for the sum of a sequence of combinatorial games. This sum coincides with the classical sum in the case of a converging sequence of real numbers and with the infinitary natural sum in the case of a sequence of…
A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…
Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…
In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme among these widely played games is that their generalized…
Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a…
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as…
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…
A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…
We introduce the game of infinite Hex, extending the familiar finite game to natural play on the infinite hexagonal lattice. Whereas the finite game is a win for the first player, we prove in contrast that infinite Hex is a draw -- both…