English
Related papers

Related papers: Measuring the Non-Transitivity in Chess

200 papers

We have seen numerous machine learning methods tackle the game of chess over the years. However, one common element in these works is the necessity of a finely optimized look ahead algorithm. The particular interest of this research lies…

Artificial Intelligence · Computer Science 2020-07-07 Arman Maesumi

This paper presents a novel approach to analyze human decision-making that involves comparing the behavior of professional chess players relative to a computational benchmark of cognitively bounded rationality. This benchmark is constructed…

General Economics · Economics 2020-12-03 Dainis Zegners , Uwe Sunde , Anthony Strittmatter

This paper presents an empirical investigation of the relation between decision speed and decision quality for a real-world setting of cognitively-demanding decisions in which the timing of decisions is endogenous: professional chess.…

General Economics · Economics 2022-01-27 Uwe Sunde , Dainis Zegners , Anthony Strittmatter

We propose InfoChess, a symmetric adversarial game that elevates competitive information acquisition to the primary objective. There is no piece capture, removing material incentives that would otherwise confound the role of information.…

Multiagent Systems · Computer Science 2026-04-20 Kieran A. Murphy

We investigate the look-ahead capabilities of chess-playing neural networks, specifically focusing on the Leela Chess Zero policy network. We build on the work of Jenner et al. (2024) by analyzing the model's ability to consider future…

Artificial Intelligence · Computer Science 2025-05-29 Diogo Cruz

The presence or absence of winner-loser effects is a widely discussed phenomenon across both sports and psychology research. Investigation of such effects is often hampered by the limited availability of data. Online chess has exploded in…

Applications · Statistics 2025-08-12 Adam Gee , Sydney O. Seese , James P. Curley , Owen G. Ward

Repetition-based draw rules in deterministic games like chess ensure termination but introduce strategic artifacts, allowing players to enforce draws independent of positional value. We propose an asymmetric modification: threefold…

Computer Science and Game Theory · Computer Science 2026-04-07 Chong Qi

Suppose some cleverness score parameter is sufficiently interesting to be defined and then measured, perhaps for different strata of specialists or for the broader population. Such phenomena could have Gaussian distributions, when it comes…

Other Statistics · Statistics 2026-05-19 Nils Lid Hjort

The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…

Quantum Physics · Physics 2015-06-23 Marcin Makowski , Edward W. Piotrowski , Jan Sładkowski

We introduce DeepNash, an autonomous agent capable of learning to play the imperfect information game Stratego from scratch, up to a human expert level. Stratego is one of the few iconic board games that Artificial Intelligence (AI) has not…

Do neural networks build their representations through smooth, gradual refinement, or via more complex computational processes? We investigate this by extending the logit lens to analyze the policy network of Leela Chess Zero, a superhuman…

Machine Learning · Computer Science 2025-11-26 Elias Sandmann , Sebastian Lapuschkin , Wojciech Samek

We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$,…

Probability · Mathematics 2018-10-23 Artem Hulko , Mark Whitmeyer

Non-transitivity can arise in games with three or more strategies $A,B,C$, when $A$ beats $B$, $B$ beats $C$, and $C$ beats $A$, ($A>B>C>A$). An example is the children's game \textquotedblleft rock, scissors, paper" ($R,S,P$) where…

Quantum Physics · Physics 2007-05-23 Michael Stohler , Ephraim Fischbach

The concept of intransitiveness for games, which is the condition for which there is no first-player winning strategy can arise surprisingly, as happens in the Penney game, an extension of the heads or tails. Since a game can be converted…

Physics and Society · Physics 2024-03-07 Alberto Baldi , Franco Bagnoli

Competitive tournaments appear in sports, politics, population ecology, and animal behavior. All of these fields have developed methods for rating competitors and ranking them accordingly. A tournament is intransitive if it is not…

Physics and Society · Physics 2020-11-04 Alexander Strang , Karen C. Abbott , Peter J. Thomas

Complexity develops via the incorporation of innovative properties. Chess is one of the most complex strategy games, where expert contenders exercise decision making by imitating old games or introducing innovations. In this work, we study…

Physics and Society · Physics 2013-12-19 Juan I. Perotti , Hang-Hyun Jo , Ana L. Schaigorodsky , Orlando V. Billoni

It is odd that chess grandmasters often disagree in their analysis of positions, sometimes even of simple ones, and that a grandmaster can hold his own against an powerful analytic machine such as Deep Blue. The fact that there must exist…

Computational Complexity · Computer Science 2007-05-23 M. Chaves

This paper presents a data-driven statistical framework to quantify the role of skill in games, addressing the long-standing question of whether success in a game is predominantly driven by skill or chance. We analyze player level data from…

Computer Science and Game Theory · Computer Science 2025-05-28 Tathagata Banerjee , Anushka De , Subhamoy Maitra , Diganta Mukherjee

Chess and chance are seemingly strange bedfellows. Luck and/or randomness have no apparent role in move selection when the game is played at the highest levels. However, when competition is at the ultimate level, that of the World Chess…

Methodology · Statistics 2007-08-30 Mark R. Segal

Intelligent machines with superhuman capabilities have the potential to uncover problem-solving strategies beyond human discovery. Emerging evidence from competitive gameplay, such as Go and chess, demonstrates that AI systems are evolving…

Computers and Society · Computer Science 2025-08-20 Levin Brinkmann , Thomas F. Eisenmann , Anne-Marie Nussberger , Maxime Derex , Sara Bonati , Valerii Chirkov , Iyad Rahwan