HackerPapers

arXiv:2403.13855math.CO

A Non-Terminating Game of Beggar-My-Neighbor

Brayden Casella, Philip M. Anderson, Michael Kleber, Richard P. Mann, Reed Nessler, William Rucklidge, Samuel G. Williams, Nicolas Wu

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We demonstrate the existence of a non-terminating game of Beggar-My-Neighbor, discovered by lead author Brayden Casella. We detail the method for constructing this game and identify a cyclical structure of 62 tricks that is reached by 30 distinct starting hands. We further present a short history of the search for this solution since the problem was posed, and a record of previously found longest terminating games. The existence of this non-terminating game provides a solution to a long-standing question which John H. Conway called an `anti-Hilbert problem.'

arXiv comments
Journal reference
DOI
doi:10.1080/00029890.2025.2558484
Subjects
math.COCombinatorics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2025 to May 2025. Found in 1 HN submission from Dec 2024 to Dec 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • "Pointless" because it's trying to solve/make progress on "beggar-my-neighbor" which Conway called an anti-Hilbert problem [0]? Looks like infinite games have been found for Beggar my Neighbor [1] [2]. [0] https://en.wikipedia.org/wiki/Beggar-my-neighbour#Game_theor... [1]…

      abetuskView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.