English
Related papers

Related papers: Misere Connect Four is Solved

200 papers

Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in…

Logic in Computer Science · Computer Science 2019-09-18 Tom van Dijk

This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…

Combinatorics · Mathematics 2017-01-24 John Haslegrave

In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is…

History and Overview · Mathematics 2014-04-22 Thomas Jenrich

We study biased Maker-Breaker games on a graph system $\{G_1,\ldots,G_s\}$, in which Maker's goal is to claim certain rainbow structures, i.e., specified subgraphs consisting of at most one edge from each graph $G_i$. We consider the…

We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern from a target set, while the second player aims to prevent it.…

Computational Complexity · Computer Science 2025-02-18 Benjamin Hellouin de Menibus , Rémi Pallen

In a biased weak $(a,b)$ polyform achievement game, the maker and the breaker alternately mark $a,b$ previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The…

Combinatorics · Mathematics 2011-07-12 Ian Norris , Nandor Sieben

In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker…

Combinatorics · Mathematics 2015-03-17 Edgar Fisher , Nandor Sieben

The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two…

Social and Information Networks · Computer Science 2024-06-25 Alexandre Benatti , Luciano da F. Costa

The game of Hex has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid. Black wins by completing a crossing between two opposite edges, while White wins by completing a…

Probability · Mathematics 2009-02-25 Yuval Peres , Oded Schramm , Scott Sheffield , David B. Wilson

This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern…

Computer Science and Game Theory · Computer Science 2021-12-24 Michael J. Neely

Sumplete is a logic puzzle famous for being developed by ChatGPT. The puzzle consists of a rectangular grid, with each cell containing a number. The player has to cross out some numbers such that the sum of uncrossed numbers in each row and…

Computational Complexity · Computer Science 2024-07-01 Suthee Ruangwises

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…

Artificial Intelligence · Computer Science 2019-03-11 Sanjiang Li , Xueqing Yan

This paper examines multiplayer symmetric constant-sum games with more than two players in a competitive setting, including examples like Mahjong, Poker, and various board and video games. In contrast to two-player zero-sum games,…

Machine Learning · Computer Science 2024-10-04 Jiawei Ge , Yuanhao Wang , Wenzhe Li , Chi Jin

We introduce a two-player game in which one and his/her opponent attempt to pack as many ``prisoners'' as possible on the squares of an n-by-n checkerboard; each prisoner has to be ``protected'' by at least as many guards as the number of…

Combinatorics · Mathematics 2008-01-08 Timothy Howard , Eugen J. Ionascu , David Woolbright

The game of bridge consists of two stages: bidding and playing. While playing is proved to be relatively easy for computer programs, bidding is very challenging. During the bidding stage, each player knowing only his/her own cards needs to…

Artificial Intelligence · Computer Science 2019-03-06 Jiang Rong , Tao Qin , Bo An

In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the…

Combinatorics · Mathematics 2026-03-03 Rüdiger Jehn

Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game.…

History and Overview · Mathematics 2024-10-24 Benjamin Richeson , David Richeson

We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 chessboard by a single player, with only white pieces, using…

Data Structures and Algorithms · Computer Science 2022-04-01 N. R. Aravind , Neeldhara Misra , Harshil Mittal

This document presents the rules of a tactical two-player board game which is inspired by spin glasses. The aim is, while placing bonds and spins, to achieve a majority of the spins facing the chosen direction of each player. The game has…

Disordered Systems and Neural Networks · Physics 2025-12-16 Alexander K. Hartmann

In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascending subsequence of length a or a descending one of length d.…

Combinatorics · Mathematics 2007-05-23 M. Albert , R. Aldred , M. Atkinson , C. Handley , D. Holton , D. McCaughan , B. Sagan
‹ Prev 1 3 4 5 6 7 10 Next ›