Related papers: Multi-Dimensional Chocolate and Nim with a Pass
Combinatorial Scoring games, with the property `extra pass moves for a player does no harm', are characterized. The characterization involves an order embedding of Conway's Normal-play games. Also, we give a theorem for comparing games with…
Sprout is a two-player pen and paper game which starts with $n$ vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-cubic planar at all times. The first player not being able…
Quantum technologies, i.e., technologies benefiting from the features of quantum physics such as objective randomness, superposition, and entanglement, have enabled an entirely different way of distributing and processing information. The…
A quantum walker moves on the integers with four extra degrees of freedom, performing a coin-shift operation to alter its internal state and position at discrete units of time. The time evolution is described by a unitary process. We focus…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
Traveler's dilemma (TD) is one of social dilemmas which has been well studied in the economics community, but it is attracted little attention in the physics community. The TD game is a two-person game. Each player can select an integer…
The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in…
We present some elementary but foundational results concerning diamond-colored modular and distributive lattices and connect these structures to certain one-player combinatorial "move-minimizing games," in particular, a so-called "domino…
In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit…
Wythoff Nim aka Corner the Lady is a classic combinatorial game. A Queen is placed on an infinite chess board and two players take alternate turns, moving the Queen closer to the corner. The first player that corners the Queen wins. What…
Aim: Present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of…
Distance games are games played on graphs in which the players alternately colour vertices, and which vertices can be coloured only depends on the distance to previously coloured vertices. The polynomial profile encodes the number of…
Communication is a crucial ingredient in every kind of collaborative work. But what is the least possible amount of communication required for a given task? We formalize this question by introducing a new framework for distributed…
The subject of this talk was the review of our study of three ($2+1$) dimensional Quantum Chromodynamics. In our previous works, we showed the existence of a phase where parity is unbroken and the flavor group $U(2n)$ is broken to a…
We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player repeatedly removes a chosen connected monochromatic group…
A large class of Positional Games are defined on the complete graph on $n$ vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his subgraph has a given -- usually monotone -- property. Here we…
The triangle game introduced by Chv\'{a}tal and Erd\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\in\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph…
We propose the $(3+1)$-dimensional $\mathbb{Z}_3$ lattice gauge theory coupled with the 2-flavor Wilson-Dirac fermion as a toy model for studying quantum chromodynamics (QCD) at nonzero density. We study its phase diagram in the space of…
As the earliest and one of the most fundamental learning dynamics for computing NE, fictitious play (FP) has being receiving incessant research attention and finding games where FP would converge (games with FPP) is one central question in…
This paper presents results from the design and testing of an educational version of Quantum Moves, a Scientific Discovery Game that allows players to help solve authentic scientific challenges in the effort to develop a quantum computer.…