Related papers: Diamond Solitaire
In this paper, we study some cards shuffles which are used by magicians. We focus ourselves on the possibility to hit eventually the initial state after several shuffles. This is a classical problem arising in discrete dynamical systems.…
Given $k\ge 3$ heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most $k-1$ heaps, or to remove the {\sl same} positive number of tokens from all the $k$ heaps. We analyse…
We study the complexity of a particular class of board games, which we call `slide and merge' games. Namely, we consider 2048 and Threes, which are among the most popular games of their type. In both games, the player is required to slide…
We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of some classical results of combinatorics including ballot…
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph $G$ and take it into a set $D$. The number of vertices dominated by the set $D$ must increase in each single turn and the game ends when $D$…
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimization problem on a set of words defined by seven classes of…
The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vertex is the winner. The game fits into the scheme of several…
Pebbling is a game played on a graph. The single player is given a graph and a configuration of pebbles and may make pebbling moves by removing 2 pebbles from one vertex and placing one at an adjacent vertex to eventually have one pebble…
A set of n boxes, located on the vertices of a hypergraph G, contain known but different rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of collecting the maximum possible total reward. Some of the boxes,…
In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of…
A matching set $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. In this paper we consider some parameters related to the matching of regular graphs. We find the sixth coefficient of the…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and…
The $m \times n$ king graph consists of all locations on an $m \times n$ chessboard, where edges are legal moves of a chess king. %where each vertex represents a square on a chessboard and each edge is a legal move. Let $P_{m \times n}(z)$…
A diamond is a $4$-tournament which consists of a vertex dominating or dominated by a $3$-cycle. Assuming the existence of skew-conference matrices, we give a complete characterization of $n$-tournaments with the maximum number of diamonds…
We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120-degree angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum…
Bidding chess is a chess variant where instead of alternating play, players bid for the opportunity to move. Generalizing a known result on so-called Richman games, we show that for a natural class of games including bidding chess, each…
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,…