Transition-computability conjecture for the Yu-Gi-Oh! TCG
Transition-computability conjecture for the Yu-Gi-Oh! TCG
A game configuration is a complete description of a position in the Yu-Gi-Oh! TCG, and a legal move is an action permitted from that configuration. The consequent configuration is the position resulting from applying the legal move.
Transition-computability conjecture. The function mapping a game configuration together with a legal move to the consequent configuration in the Yu-Gi-Oh! TCG is computable.
This conjecture would provide the technical foundation for treating the game as transition-computable and for rigorously analyzing strategies that simulate Turing-machine computations. The paper notes that proving it appears difficult without an exhaustive analysis of the more than 13,000 cards currently in the game.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Orazio Nicolosi, Federico Pisciotta and Lorenzo Bresolin, “Deciding winning strategies in Yu-Gi-Oh! TCG is hard”, arXiv:2603.02863 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.