Related papers: Quixo Is Solved
The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot succeed with probability greater than 1-ln2 \approx 0.31, no matter how many players are…
An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…
In this paper we correct an analysis of the two-player perfect-information game Dukego given in Berlekamp, Conway, and Guy's Winning Ways for your Mathematical Plays (Chapter 19). In particular, we characterize the board dimensions that are…
In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…
We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…
We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then…
In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum…
We introduce a simple extensive-form algorithm for finding equilibria of two-player, zero-sum games. The algorithm is realization equivalent to a generalized form of Fictitious Play. We compare its performance to that of a similar…
Modern board games are a rich source of entertainment for many people, but also contain interesting and challenging structures for game playing research and implementing game playing agents. This paper studies the game Patchwork, a two…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
Mahjong is a very popular tile-based game commonly played by four players. Each player begins with a hand of 13 tiles and, in turn, players draw and discard (i.e., change) tiles until they complete a legal hand using a 14th tile. In this…
We introduce a two player game on an n x n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the number of queens already on the board which can attack that square modulo two.…
A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is…
A positional game is a game where two players sequentially label vertices of a hypergraph, consisting of a board and a collection of winning sets, with colors assigned to each player until all vertices of the board are claimed. The first…
Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games admit a simple bottom-up algorithm for finding subgame…
Tetravex is a widely played one person computer game in which you are given $n^2$ unit tiles, each edge of which is labelled with a number. The objective is to place each tile within a $n$ by $n$ square such that all neighbouring edges are…
Adversarial training, a special case of multi-objective optimization, is an increasingly prevalent machine learning technique: some of its most notable applications include GAN-based generative modeling and self-play techniques in…
A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of…
This article presents a new three-player version of the bridge playing card game for the purpose of ending fixed partnerships so that the play can be more dynamic and flexible. By dynamically redefining team makeup in real time, this game…