标题： 组合博弈系列 显示英文标题

标题： Series of combinatorial games

摘要： 我们为组合游戏序列的和提供一个定义。 这种和在实数序列收敛的情况下与经典和一致，在序数序列的情况下与无限自然和一致。 我们简要讨论其他可能性，例如字符串极限、一些“魔法”变体的Hackenbush，以及允许超限运行但仍无循环的“达达主义”无限和。 显示英文摘要

摘要： We present a definition for the sum of a sequence of combinatorial games. This sum coincides with the classical sum in the case of a converging sequence of real numbers and with the infinitary natural sum in the case of a sequence of ordinal numbers. We briefly discuss other possibilities, such as the string limit, some "magical" variants of Hackenbush, as well as "Dadaist" infinite sums, which allow transfinite runs, while still being loopfree.