Infinite sums of combinatorial games (Dadaist games)

We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of an alternating run.

Publication Details

Journal
ArXiv.org
Published
2025-05-01
Primary Topic
Artificial Intelligence in Games
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Infinite sums of combinatorial games (Dadaist games)

ArXiv.org
Artificial Intelligence in Games
article

Infinite sums of combinatorial games (Dadaist games)

article en

Abstract

We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of an alternating run.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 73%
Artificial Intelligence in Games
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Infinite sums of combinatorial games (Dadaist games) · ArXiv.org (2025) | TGRS Research Map | TGRS