Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.23406

The Dynamical Landscape of Beggar-My-Neighbour: Ultra-long Matches, Loops, and Infinite Matches

Nicolas Andorno·Giulio Cernoia·Simone Duiz·Alessandro Michelangeli
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a rigorous mathematical and computational analysis of the deterministic card game \emph{Beggar-My-Neighbour}. By establishing a formal state-space framework, we investigate the game's dynamical landscape, focussing on the dichotomy between terminating and non-terminating matches. Extensive numerical simulations reveal that the distribution of finite match durations \emph{approximates} an exponential decay, with relevant deviations, confirming an emergent memory-less dynamics. This statistical behaviour is further analysed in the context of ultra-long matches, where we identify characteristic multi-scale oscillatory patterns and entropic regimes. Theoretically, we address the problem of backwards determinism, formalising the lack of injectivity of the trick function even within the set of reachable states. Crucially, we contribute to the recent resolution of the long-standing question regarding the existence of infinite games. We introduce an automated `Infinite Loop Factory' algorithm which, by implementing adaptive insertion strategies, proves effective in identifying non-terminating cycles with balanced initial deck configurations, thereby confirming the existence of non-terminating dynamics in standard and generalised settings of the game.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Nicolas Andorno, Giulio Cernoia, Simone Duiz, Alessandro Michelangeli. 2026-02-26. The Dynamical Landscape of Beggar-My-Neighbour: Ultra-long Matches, Loops, and Infinite Matches. https://arxiv.org/abs/2602.23406

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗