相关论文: How to Beat Capablanca

We train an agent to compete in the game of Gardner minichess, a downsized variation of chess played on a 5x5 board. We motivated and applied a SOTA actor-critic method Proximal Policy Optimization with Generalized Advantage Estimation. Our…

The game of chess is well-known and widely played all over the world. However, the rules for playing it are rather complex since there are different types of pieces and the ways they are allowed to move depend upon the type of the piece. In…

Assessing the skill level of players to predict the outcome and to rank the players in a longer series of games is of critical importance for tournament play. Besides weaknesses, like an observed continuous inflation, through a steadily…

We study two-player positional games where Maker and Breaker take turns to select a previously unoccupied number in $\{1,2,\ldots,n\}$. Maker wins if the numbers selected by Maker contain a solution to the equation \[…

We study the $(m,b)$ Maker-Breaker percolation game on $\mathbb{Z}^2$, introduced by Day and Falgas-Ravry. As our first result, we show that Breaker has a winning strategy for the $(m,b)$-game whenever $b \geq (2-\frac{1}{14} + o(1))m$,…

Abstract Like electoral systems, decision-making methods are also vulnerable to manipulation by decision-makers. The ability to effectively defend against such threats can only come from thoroughly understanding the manipulation mechanisms.…

We study the Maker-Maker version of the domination game introduced in 2018 by Duch\^ene et al. Given a graph, two players alternately claim vertices. The first player to claim a dominating set of the graph wins. As the Maker-Breaker…

The problem of electing a leader from among $n$ contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given $n$ processors, all participants must eventually return a…

Recent advances in deep reinforcement learning (RL) have led to considerable progress in many 2-player zero-sum games, such as Go, Poker and Starcraft. The purely adversarial nature of such games allows for conceptually simple and…

We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each…

Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…

Position play is a key feature of carom billiards: on easy shots players can manage to score while ensuring that the next position will be favorable. The difficulty of a shot therefore depends on the previous shot, e.g. an easy shot…

We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion,…

Domineering is a two-player game played on a checkerboard in which one player places dominoes vertically, while the other places them horizontally. In this paper, we find out the minimum number of moves for a game of Domineering to end on…

In this paper we apply model predictive control (MPC), rollout, and reinforcement learning (RL) methodologies to computer chess. We introduce a new architecture for move selection, within which available chess engines are used as…

A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner, which, unlike the Condorcet winner, is…

When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck.…

In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions 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…

A king in a directed graph is a vertex $v$ such that every other vertex is reachable from $v$ via a path of length at most $2$. It is well known that every tournament (a complete graph where each edge has a direction) has at least one king.…