Related papers: R\'esolution du jeu de Juniper Green

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…

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…

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…

An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this paper we propose polynomial time approximate and exponential…

In this paper we study a single player game consisting of $n$ black checkers and $m$ white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general $n$ and $m$ is $nm + n +…

This paper aims to investigate the existence and uniqueness of solutions for a sixth order differential equation involving nonlocal and integral boundary conditions. Firstly, we obtain the properties of the relevant Green's functions. The…

In this paper we show that every combinatorial problem has an exact explicit equation that returns its solution. We present a method to obtain an equation that solves exactly any combinatorial problem, both inversion, constraint…

Abalone is a 2-player board game with perfect information. The game is played on a 5x5x5 hexagonal grid and ends when a player pushes 6 of their opponents' pieces off the board. Abalone is similar to games like chess and Go in that all…

Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as…

This article is devoted to deduce the expression of the Green's function related to a general constant coefficients fractional difference equation coupled to Dirichlet conditions. In this case, due to the points where some of the fractional…

The game of Othello is one of the world's most complex and popular games that has yet to be computationally solved. Othello has roughly ten octodecillion (10 to the 58th power) possible game records and ten octillion (10 to the 28th power)…

We will describe a combinatorial game that models the problem of resolution of singularities of algebraic varieties over a field of characteristic zero. By giving a winning strategy for this game, we give another proof of the existence of…

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…

Sumplete is a logic puzzle famous for being developed by ChatGPT. The puzzle consists of a rectangular grid, with each cell containing a number. The player has to cross out some numbers such that the sum of uncrossed numbers in each row and…

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…

In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…

This paper provides a decomposition technique for the purpose of simplifying the solution of certain zero-sum differential games. The games considered terminate when the state reaches a target, which can be expressed as the union of a…

A 5x5 board is the smallest board on which one can set up all kind of chess pieces as a start position. We consider Gardner's minichess variant in which all pieces are set as in a standard chessboard (from Rook to King). This game has…