Related papers: Niel's Chess -- Rules for Xiangqi
This paper presents an empirical exploration of non-transitivity in perfect-information games, specifically focusing on Xiangqi, a traditional Chinese board game comparable in game-tree complexity to chess and shogi. By analyzing over…
This paper studies a special kind of equilibrium termed as "balanced equilibrium" which arises in the power allocation game defined in \cite{allocation}. In equilibrium, each country in antagonism has to use all of its own power to…
In this paper, we introduce a variant of Francis Su's "Game of Cycles," that we call "Cycles with Sources." The only change to the rules is permitting nodes to be sources, while sinks are still prohibited. Despite this minor change in the…
Moves in chess games are usually analyzed on a case-by-case basis by professional players, but thanks to the availability of large game databases, we can envision another approach of the game. Here, we indeed adopt a very different point of…
Wythoff Nim aka Corner the Lady is a classic combinatorial game. A Queen is placed on an infinite chess board and two players take alternate turns, moving the Queen closer to the corner. The first player that corners the Queen wins. What…
Our paper addresses characterizing conditions for a linear quadratic (LQ) game to be a potential game. The desired properties of potential games in finite action settings, such as convergence of learning dynamics to Nash equilibria, and the…
The subject of this paper is a variation of a blackjack game, mainly popular in some parts of Europe where it is known as einz (in German slang: one). We describe the rules of this game, indicate its main characteristics, give some…
The crossword-like patterns of tiles in Scrabble form connected graphs of occupied sites on a square lattice. We find the most structureless description that reproduces means and covariances observed in real Scrabble games by adapting a…
We modify Wythoff's game by allowing an additional move, which we call a "split", and show how the $P$-positions are coded by the Tribonacci word. We analyze the table of letter positions of arbitrary $k$-bonacci words and find a…
This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…
It is non-trivial to design engaging and balanced sets of game rules. Modern chess has evolved over centuries, but without a similar recourse to history, the consequences of rule changes to game dynamics are difficult to predict. AlphaZero…
With the aid of mathematical modelling (basic tool is the random walk with absorbing barriers) we derive subsequent formulas to study the effect of different versions of possible rules. For different rules the probability of winning a game,…
We show the chess billiard map, which was introduced in [HM] in order to study a generalization of the $n$-Queens problem in chess, is a circle homeomorphism. We give a survey of some of the known results on circle homeomorphisms, and apply…
This paper develops a distributed resource allocation game to study countries' pursuit of targets such as self-survival in the networked international environment. The contributions are two. First, the game formalizes countries' power…
In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is…
We present here the new insight or revisiting the algorithm for playing in Chess with incomplete information (which can be recognized by its newly short-name as Phoenix-Chess strategy). The only difference with respect to the classical…
We study a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes. The agents are only told whether the…
Representing a board game and its positions by text-based notation enables the possibility of NLP applications. Language models, can help gain insight into a variety of interesting problems such as unsupervised learning rules of a game,…
Nash equilibrium (NE) is a central concept in game theory. Here we prove formally a published theorem on existence of an NE in two proof assistants, Coq and Isabelle: starting from a game with finitely many outcomes, one may derive a game…
The present work consisted in developing a plateau game. There are the traditional ones (monopoly, cluedo, ect.) but those which interest us leave less place at the chance (luck) than to the strategy such that the chess game. Kallah is an…