Related papers: New problems on old solitaire boards
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board,…
Clobber is a new two-player board game. In this paper, we introduce the one-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a…
This paper collects some problems that I have encountered during the years, have puzzled me and which, to the best of my knowledge, are still open. Most of them are well-known and have been first stated by other authors. In this sad season…
In recent literature there are an increasing number of papers where the forbidden sets of difference equations are computed. We review and complete different attempts to describe the forbidden set and propose new perspectives for further…
Games have benchmarked AI methods since the inception of the field, with classic board games such as Chess and Go recently leaving room for video games with related yet different sets of challenges. The set of AI problems associated with…
Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful…
We discuss the practical problems arising when constructing any (new or old) scales on slide rules, i.e. realizing the theory in the practice. This might help anyone in planning and realizing (mainly the magnitude and labeling of) new…
We consider the computational complexity of the question whether a certain strategy can be removed from a game by means of iterated elimination of dominated strategies. In particular, we study the influence of different definitions of…
We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.
Tablut is a complete-knowledge, deterministic, and asymmetric board game, which has not been solved nor properly studied yet. In this work, its rules and characteristics are presented, then a study on its complexity is reported. An upper…
The peer review system as used in several computer science communities has several flaws including long review times, overloaded reviewers, as well as fostering of niche topics. These flaws decrease quality, lower impact, slowdown the…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
The effect of removing gamification elements from interactive systems has been a long-standing question in gamification research. Early work and foundational theories raised concerns about the endurance of positive effects and the emergence…
We analyze a solitaire game in which a demon rearranges some cards after each move. The graph edge coloring theorems of K\H{o}nig (1931) and Vizing (1964) follow from the winning strategies developed.
Collectible card games are challenging, widely played games that have received increasing attention from the AI research community in recent years. Despite important breakthroughs, the field still poses many unresolved challenges. This work…
The paper has been withdrawn.
We give a simple proof of that determining solvability of Shisen-Sho boards is NP-complete. Furthermore, we show that under realistic assumptions, one can compute in logarithmic time if two tiles form a playable pair. We combine an…
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.…
This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.
In this paper I investigate the problem of tagging elements of a set, and the elements of those elements, uniquely, when they admit an order, and two boundary elements are tagged. A heuristic sorting algorithm is also investigated. (Updated…