Related papers: Sequencing Chess
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
We investigate the long-run behavior of a stochastic replicator process, which describes game dynamics for a symmetric two-player game under aggregate shocks. We establish an averaging principle that relates time averages of the process and…
We examine a type of modified Monte Carlo Tree Search (MCTS) for strategising in combinatorial games. The modifications are derived by analysing simplified strategies and simplified versions of the underlying game and then using the results…
We introduce a quantitative framework for separating skill and chance in games by modeling them as complementary sources of control over stochastic decision trees. We define the Skill-Luck Index S(G) in [-1, 1] by decomposing game outcomes…
We provide two methodologies in the area of computation theory to solve optimal strategies for board games such as Xi Gua Qi and Go. From experimental results, we find relevance to graph theory, matrix representation, and mathematical…
The game subset take-away begins with a simplicial complex \Delta. Two players take turns removing any element of \Delta as well as all other elements which contain it, and the last player able to move wins. Graph Chomp is a special case of…
We adapt Vertex models to understand the physical origin of the formation of long-range ordered structures in repulsive soft particles. The model incorporates contributions from the volume and surface area of each particle. Sampling using…
Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…
We perform a quantitative analysis of extensive chess databases and show that the frequencies of opening moves are distributed according to a power-law with an exponent that increases linearly with the game depth, whereas the pooled…
Stochastic systems feature, in general, both coherent dynamics and incoherent transitions between different states. We propose a method to identify the coherent part in the full counting statistics for the transitions. The proposal is…
The majority game, modelling a system of heterogeneous agents trying to behave in a similar way, is introduced and studied using methods of statistical mechanics. The stationary states of the game are given by the (local) minima of a…
This short communication shows that the Chessography encryption scheme is incorrect, redundant, and the the security claims based on the complexity of chess games are unjustified. It also demonstrates an insufficient randomness in the final…
We study the large-scale dynamics of event chain Monte Carlo algorithms in one dimension, and their relation to the true self-avoiding walk. In particular, we study the influence of stress, and different forms of interaction on the…
A class of nonzero-sum stochastic dynamic games with imperfect information structure is investigated. The game involves an arbitrary number of players, modeled as homogeneous Markov decision processes, aiming to find a sequential Nash…
Quantitative measures of randomness in games are useful for game design and have implications for gambling law. We treat the outcome of a game as a random variable and derive a closed-form expression and estimator for the variance in the…
We present a new tool for the study of multiplayer stochastic games, namely the modified game, which is a normal-form game that depends on the discount factor, the initial state, and for every player a partition of the set of states and a…
We analyze what happens to the average duration of a game of Chutes and Ladders as the probability of rolling $\delta \in \{ 1,2,3,4,5,6\}$ approaches 100%. We utilize Markov models, and Monte Carlo simulations in Python. We also introduce…
Billiards tables - a minimal model for particles moving in a confined region - are known to present classical (and quantum) different features according to their shape, ranging from strongly chaotic to integrable dynamics. Here we consider…
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so long as at least half his 2w nearest neighbors are of the same…
The basic problem in equilibrium statistical mechanics is to compute phase space average, in which Monte Carlo method plays a very important role. We begin with a review of nonlocal algorithms for Markov chain Monte Carlo simulation in…