{
    "@context": "https://schema.org",
    "@type": "NewsArticle",
    "@id": "https://badiyaa.com/magic-the-gathering-turing-complete-papers/#article",
    "mainEntityOfPage": "https://badiyaa.com/magic-the-gathering-turing-complete-papers/",
    "headline": "Magic: The Gathering is Turing complete, and 2026 papers extend the finding to Yu-Gi-Oh and Riftbound",
    "description": "Magic: The Gathering can encode a Turing machine, a 2019 paper shows, and 2026 papers apply the same proof style to Yu-Gi-Oh and Riftbound.",
    "datePublished": "2026-11-19T19:00:00+00:00",
    "dateModified": "2026-11-19T19:00:00+00:00",
    "author": {
        "@type": "Organization",
        "name": "Badiyaa Editorial Desk",
        "url": "https://badiyaa.com/author/editorial-desk/"
    },
    "publisher": {
        "@type": "NewsMediaOrganization",
        "@id": "https://badiyaa.com/#organization",
        "name": "Badiyaa",
        "url": "https://badiyaa.com/",
        "logo": {
            "@type": "ImageObject",
            "url": "https://badiyaa.com/wp-content/uploads/2026/10/badiyaa-logo-color-600x60-1.png",
            "width": 600,
            "height": 60
        },
        "email": "badiyaavideo@gmail.com",
        "publishingPrinciples": "https://badiyaa.com/editorial-policy/",
        "correctionsPolicy": "https://badiyaa.com/corrections/",
        "actionableFeedbackPolicy": "https://badiyaa.com/contact/",
        "ownershipFundingInfo": "https://badiyaa.com/about/#ownership",
        "sameAs": [
            "https://www.facebook.com/profile.php?id=61595518283625",
            "https://www.instagram.com/badiyaa.com.ai/",
            "https://www.threads.net/@badiyaa.com.ai"
        ],
        "parentOrganization": {
            "@type": "Organization",
            "name": "Rezilient Digital",
            "url": "https://www.rezilientdigital.com/",
            "address": {
                "@type": "PostalAddress",
                "streetAddress": "Fl No 3, Nav Shyam Sadan, Plot No 38, Pestom Sagar, Chembur",
                "addressLocality": "Mumbai",
                "addressRegion": "Maharashtra",
                "postalCode": "400089",
                "addressCountry": "IN"
            },
            "sameAs": [
                "https://www.linkedin.com/company/rezilientdigital"
            ]
        }
    },
    "isAccessibleForFree": true,
    "inLanguage": "en-US",
    "wordCount": 712,
    "image": [
        "https://badiyaa.com/wp-content/uploads/2026/11/magic-the-gathering-players-scaled.webp",
        "https://badiyaa.com/wp-content/uploads/2026/11/magic-the-gathering-players-1024x682.webp"
    ],
    "articleSection": "Gaming",
    "keywords": "arXiv, Magic: The Gathering, Riftbound, Turing machine, Yu-Gi-Oh!",
    "articleBody": "A game of Magic: The Gathering can be set up so that nobody, not even a perfect computer, can say in advance who will win. That is the result of a 2019 paper by Alex Churchill, Stella Biderman and Austin Herrick, and in 2026 it has become a template: researchers have now applied the same idea to Yu-Gi-Oh! and to Riftbound, the League of Legends card game. In the 2019 paper &#8220;Magic: The Gathering is Turing Complete&#8221;, the three authors show how to build an arbitrary Turing machine, the abstract model behind every computer, out of cards on the battlefield. They arranged it so the first player is guaranteed to win if and only if the machine halts. Because the halting problem is famously unsolvable, so is predicting the winner of that game. Part of the reason is baked into the rules. One of the game&#8217;s &#8220;golden rules,&#8221; as the encyclopedia entry on Magic: The Gathering rules records it, is: &#8220;Whenever a card&#8217;s text directly contradicts these rules, the card takes precedence&#8221;. With tens of thousands of cards each able to rewrite the game, strange machines become possible. A game where no one makes a choice The strangest part is how passive the construction is. The authors write that every move of both players is forced, so the game plays itself. Even so, they conclude, &#8220;even recognising who will win a game in which neither player has a non-trivial decision to make for the rest of the game is undecidable.&#8221; The setup uses standard-size, tournament-legal decks and relies on no luck or hidden cards. Biderman then pushed further. In her 2020 follow-up, &#8220;Magic: the Gathering is as Hard as Arithmetic&#8221;, she looked at the card-game version of chess&#8217;s &#8220;mate in n&#8221; puzzle: can a player force a win within a set number of turns? She showed that each extra turn lifts the problem one rung higher on a ladder of logical difficulty that mathematicians call the arithmetical hierarchy, and that optimal two-player play sits above that whole ladder. Why each extra turn matters A quick way to picture the growth: a one-turn puzzle asks whether some line of play wins. A two-turn puzzle asks whether some line wins against every reply, and a three-turn puzzle adds another layer of &#8220;for some&#8221; on top of that. Each turn nests a new question inside the old one, and Biderman&#8217;s result says Magic can encode all of those nested questions, so no fixed, finite method can solve every version. The 2026 wave This year the idea spread to rival games. In March, Orazio Nicolosi, Federico Pisciotta and Lorenzo Bresolin posted &#8220;Deciding winning strategies in Yu-Gi-Oh! TCG is hard&#8221;, citing the Magic results as their starting point. They prove that checking whether a given strategy wins from a given position is undecidable, and they supply two decks that are legal under the current Forbidden and Limited List. In September, Nathan Dalaklis and Beckett Fields posted &#8220;Riftbound is Turing Complete&#8221;. Riftbound launched in China in August 2025 and in the US that October, and the pair show universal Turing machines can be built inside it with tournament-legal decks, in some board states within a single turn. Not every new Magic paper is about impossibility. In July, Tomas Rigaux and Hisashi Kashima posted a study predicting how strong a drafted Magic deck will be, where eight players each make 39 to 45 picks to build a 40-card deck. They call their model the first learned benchmark for outcome prediction in Magic Draft. Card games have a long and odd history, as our look at how an Ohio barber invented Uno in 1971 shows. For more on the industry, browse our Gaming section. Sources Magic: The Gathering is Turing Complete (Churchill, Biderman, Herrick), Cornell University e-print service, 2019 Magic: the Gathering is as Hard as Arithmetic (Biderman), Cornell University e-print service, 2020 Deciding winning strategies in Yu-Gi-Oh! TCG is hard (Nicolosi, Pisciotta, Bresolin), Cornell University e-print service, 2026 Riftbound is Turing Complete (Dalaklis, Fields), Cornell University e-print service, 2026 Predicting Drafted Deck Strength for Magic: the Gathering (Rigaux, Kashima), Cornell University e-print service, 2026 Magic: The Gathering rules, Wikimedia Foundation encyclopedia, 2026 Image: U.S. Air Force photo by Airman 1st Class Kyle Gese, Public domain via Wikimedia Commons This article was produced with AI assistance and reviewed by our Editorial Desk. How we work.",
    "markdown": "https://badiyaa.com/magic-the-gathering-turing-complete-papers.md"
}