pith. sign in

arxiv: 2604.03683 · v1 · submitted 2026-04-04 · 💻 cs.GT · physics.soc-ph

Asymmetric reformulation of draw rules in chess and its implications for game theory: Repetition as loss for White

classification 💻 cs.GT physics.soc-ph
keywords drawchesswhiteadvantageasymmetricfirst-movegameloss
0
0 comments X
read the original abstract

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 repetition results in a loss for White if it is responsible for initiating it. This rule directly targets the persistent first-move advantage and removes low-effort draw strategies available to White. The new rule is expected to reduce draw rates, re-balance first-move advantage, and promote exploration in both human and artificial play. We outline a computational framework with existing and newly designed neural-network chess engines for the empirical validation of the proposal and analyze it from the perspectives of game theory and graph dynamics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.