相关论文: The Secrets of Notakto: Winning at X-only Tic-Tac-…

We are investigating who has the winning strategy in a game in which two players take turns drawing arrows trying to complete cycle cells in a graph. A cycle cell is a cycle with no chords. We examine game boards where the winning strategy…

We introduce the Maker-Breaker domination game, a two player game on a graph. At his turn, the first player, Dominator, select a vertex in order to dominate the graph while the other player, Staller, forbids a vertex to Dominator in order…

Past efforts to classify impartial three-player combinatorial games (the theories of Li and Straffin) have made various restrictive assumptions about the rationality of one's opponents and the formation and behavior of coalitions. One may…

We identify a new type of paradoxical behavior in dice, where the sum of independent rolls produces a deceptive sequence of dominance relations. We call these ``anti-inductive dice". Consider a game with two players and two non-identical…

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…

We study the positional game where two players, Maker and Breaker, alternately select respectively $1$ and $b$ previously unclaimed edges of $K_n$. Maker wins if she succeeds in claiming all edges of some odd cycle in $K_n$ and Breaker wins…

We develop a new approach that computes approximate equilibrium strategies in Jotto, a popular word game. Jotto is an extremely large two-player game of imperfect information; its game tree has many orders of magnitude more states than…

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class…

In the 60's Shapley provided an example of a two player fictitious game with periodic behaviour. In this game, player $A$ aims to copy $B$'s behaviour and player $B$ aims to play one ahead of player $A$. In this paper we generalize…

This paper presents a new partial two-player game, called the \emph{cannibal animal game}, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first…

The game of nim, with its simple rules, its elegant solution and its historical importance is the quintessence of a combinatorial game, which is why it led to so many generalizations and modifications. We present a modification with a new…

We study the computational complexity of the popular board game backgammon. We show that deciding whether a player can win from a given board configuration is NP-Hard, PSPACE-Hard, and EXPTIME-Hard under different settings of known and…

The two main results of this work are the following: if a space $X$ is such that player II has a winning strategy in the game $\gone(\Omega_x, \Omega_x)$ for every $x \in X$, then $X$ is productively countably tight. On the other hand, if a…

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…

We consider a two-player game in which the first player (the Guesser) tries to guess, edge-by-edge, the path that second player (the Chooser) takes through a directed graph. At each step, the Guesser makes a wager as to the correctness of…

The multiplication game is a two-person game in which each player chooses a positive integer without knowledge of the other player's number. The two numbers are then multiplied together and the first digit of the product determines the…

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…

We verify a conjecture of Nowakowski and Ottaway that closed $1 \times n$ Dots-and-Triangles is a first-player win when $n \neq 2$. We also prove that in both the open and closed $1 \times n$ Dots-and-Boxes games where $n$ is even, the…

Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker representation. Our…

Wythoff's Game is a game for two players playing alternately on two stacks of tiles. On her turn, a player can either remove a positive number of tiles from one stack, or remove an equal positive number of tiles from both stacks. The last…