相关论文: Solving Triangular Peg Solitaire

We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

We prove that a sufficiently strong parallel repetition theorem for a special case of multiplayer (multiprover) games implies super-linear lower bounds for multi-tape Turing machines with advice. To the best of our knowledge, this is the…

In simple card games, cards are dealt one at a time and the player guesses each card sequentially. We study problems where feedback (e.g. correct/incorrect) is given after each guess. For decks with repeated values (as in blackjack where…

We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…

We indulge in what mathematicians call frivolous activities. In Arithmetic Billiards, a ball is bouncing around in a rectangle. In Parity Checkers we place checkers on a checkerboard under certain parity constraints. Both activities turn…

Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not…

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to…

We present a game inspired by research on the possible number of billiard ball collisions in the whole Euclidean space. One player tries to place $n$ static "balls" with zero radius (i.e., points) in a way that will minimize the total…

We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…

We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in choosing edges emanating from the vertex they are currently…

A right triangular billiard system is equivalent to the system of two colliding particles confined in a one-dimensional box. In spite of their seeming simplicity, no definite conclusion has been drawn so far concerning their ergodic…

A cellular game is a dynamical system in which cells, placed in some discrete structure, are regarded as playing a game with their immediate neighbors. Individual strategies may be either deterministic or stochastic. Strategy success is…

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…

We introduce an impartial combinatorial game on Steiner triple systems called Nofil. Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. We explore the play of…

We introduce a new combinatorial game, named Triangle Game. In this game, a directed $3$-cycle graph is given, and tokens are placed on each vertex. The player chooses an edge and takes at least one token from the initial vertex. At the…

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…

We provide an algorithm to find the value and an optimal strategy of the solitaire variant of the Ten Thousand dice game in the framework of Markov Control Processes. Once an optimal critical threshold is found, the set of non-stopping…

Consider a very simple class of (finite) games: after an initial move by nature, each player makes one move. Moreover, the players have common interests: at each node, all the players get the same payoff. We show that the problem of…

Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, because they are widely…