English
Related papers

Related papers: Phutball Draws

200 papers

We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether…

Computational Complexity · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , David Eppstein

We consider the $n\times n$ game of Phutball. It is shown that, given an arbitrary position of stones on the board, it is a PSPACE-hard problem to determine whether the specified player can win the game, regardless of the opponent's choices…

Computer Science and Game Theory · Computer Science 2021-03-05 Dariusz Dereniowski

We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…

For any odd integer $n\geq3$ a board (of size $n$) is a square array of $n\times n$ positions with a simple rule of how to move between positions. The goal of the game we introduce is to find a path from the upper left corner of a board to…

Combinatorics · Mathematics 2025-03-05 Ary Shaviv

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.…

Combinatorics · Mathematics 2017-12-18 Michael Fisher , Craig Tennenhouse

We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each…

Discrete Mathematics · Computer Science 2012-09-11 Sebastian Böcker

Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of…

Combinatorics · Mathematics 2020-04-01 Svenja Huntemann , Neil A. McKay

Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note,…

Combinatorics · Mathematics 2013-05-16 Gabriel C. Drummond-Cole

Domineering is a two-player game played on a checkerboard in which one player places dominoes vertically, while the other places them horizontally. In this paper, we find out the minimum number of moves for a game of Domineering to end on…

Combinatorics · Mathematics 2020-11-05 Rohan Karthikeyan , Siddharth Sinha

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

A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…

Machine Learning · Computer Science 2007-05-23 Philippe Jehiel , Dov Samet

We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of…

Combinatorics · Mathematics 2011-06-09 Stephanie Jones , Joshua D. Laison , Cameron McLeman , Kathryn Nyman

We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position,…

Computational Complexity · Computer Science 2018-03-13 Jeffrey Bosboom , Erik D. Demaine , Mikhail Rudoy

We show that it is perfectly possible to play 'restricted' two-players, two-strategies quantum games proposed originally by Marinatto and Weber having as the only equipment a pack of 10 cards. The 'quantum board' of such a model of these…

Quantum Physics · Physics 2008-11-15 Diederik Aerts , Haroun Amira , Bart D'Hooghe , Andrzej Posiewnik , Jaroslaw Pykacz

Quixo is a two-player game played on a 5$\times$5 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a combination of value iteration and backward induction, we…

Computer Science and Game Theory · Computer Science 2020-08-03 Satoshi Tanaka , François Bonnet , Sébastien Tixeuil , Yasumasa Tamura

Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element…

Computer Science and Game Theory · Computer Science 2011-11-22 Adam O. Kalinich

We consider a game with two piles, in which two players take turn to add $a$ or $b$ chips ($a$, $b$ are not necessarily positive) randomly and independently to their respective piles. The player who collects $n$ chips first wins the game.…

Combinatorics · Mathematics 2019-03-11 Ho-Hon Leung , Thotsaporn "Aek'' Thanatipanonda

Particle Dobble is an open-access, gamified learning tool designed to address persistent misconceptions in particle physics education by symbolically representing elements of the Standard Model. Aimed at upper secondary and introductory…

Physics Education · Physics 2026-03-02 Lukas Mientus , Anna Ruechel , Karsten Kalke , Andreas Borowski

We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…

Probability · Mathematics 2015-07-07 Jan Vrbik , Paul Vrbik

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…

Artificial Intelligence · Computer Science 2015-09-23 Nikolai Yakovenko , Liangliang Cao , Colin Raffel , James Fan
‹ Prev 1 2 3 10 Next ›