arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.13855math.CO
收藏

一场不终止的“乞丐邻居”游戏

A Non-Terminating Game of Beggar-My-Neighbor

Independent Researcher(独立研究者);Google(谷歌)

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

AI总结:

本文证明了一例不终止的“乞丐邻居”纸牌游戏的存在,详述其构造方法,识别出62轮循环结构,并解决了康威提出的长期未解问题。

摘要:

我们证明了由第一作者布雷登·卡塞拉发现的一场不终止的“乞丐邻居”游戏的存在性。我们详细阐述了构造该游戏的方法,并识别出一个由62轮牌组成的循环结构,该结构可由30种不同的初始手牌达到。我们进一步介绍了自该问题提出以来寻找此解法的简短历史,以及先前发现的最长终止游戏的记录。这一不终止游戏的存在为约翰·H·康威所称的“反希尔伯特问题”提供了一个长期悬而未决问题的解答。

英文摘要:

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.'

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑