Riftbound is Turing Complete

Nathan Dalaklis; Beckett Fields

Home/Archive/arXiv

arXiv · 2609.33839

Riftbound is Turing Complete

Nathan Dalaklis·Beckett Fields

View original source ↗Read source document ↗Export metadata ↓

Abstract

Riftbound: League of Legends Trading Card Game is a trading card game about capturing and holding locations in a king-of-the-hill style contest. Originally released in China in August of 2025, and later released in the United States in October of 2025, the game has been well received for its depth and complexity. In this paper we demonstrate a facet of this complexity by providing sequences of valid game states which construct Universal Turing machines within the game. Each of these machines are constructed with tournament legal decks at the time of writing and strategies assigned are directed by the game state. We also show that given an appropriate board state the machine may be constructed and the computation may be performed in one game turn.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Nathan Dalaklis, Beckett Fields. 2026-09-27. Riftbound is Turing Complete. https://arxiv.org/abs/2609.33839

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

KEEP EXPLORING

Related papers

arXiv2026

Rational degree is polynomially related to degree

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three open problems stated by Nisan and Szegedy, and attributed to Fortnow, in 1994.

cs.CC↗

arXiv2026

New lower bounds on tensor rank of $(n,2,m)$ matrix multiplication with GPT-6

The tensor rank of $n\times 2$-with-$2\times m$ matrix multiplication is at least $(n+2)m$ if $n\ge 4$ and at least $\left\lceil \frac{24m+2}{5} \right\rceil$ if $n=3$, over arbitrary fields. This result matches the Hopcroft-Kerr upper bound for $n=3$ and $m\le 6$.

cs.CC↗

arXiv2026

Hitting Sets for Polynomials with Small Partial Derivative Spaces

We give an explicit hitting set of size $\text{poly}(n,d,r)$ for the class of $n$-variate degree-$d$ polynomials whose partial derivative space is bounded by $r$, over any field $\mathbb{F}$ of characteristic zero. In particular, this yields a polynomial sized hitting set for the class of depth-$3$ powering circuits. The main technical insight is the construction of a "formal derivation'' and properties of the associated Wronskian with respect to this derivation, which was previously studied by Moura [Moura_2004] in a very different context. The proofs in this paper are elementary and completely self-contained. AI disclosure: The proof of this result was obtained during conversations [astra_proof] with OpenAI GPT-6 Astra. The proof presented in this writeup is a rewriting (in the authors' words) of the proof obtained by the AI model in a form that we believe is understandable to researchers.

cs.CC↗