Corpus ID: 212657345

Magic: the Gathering is as Hard as Arithmetic

@article{Biderman2020MagicTG,
  title={Magic: the Gathering is as Hard as Arithmetic},
  author={Stella Biderman},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.05119}
}
  • Stella Biderman
  • Published 2020
  • Computer Science
  • ArXiv
  • Magic: the Gathering is a popular and famously complicated card game about magical combat. Recently, several authors including Chatterjee and Ibsen-Jensen (2016) and Churchill, Biderman, and Herrick (2019) have investigated the computational complexity of playing Magic optimally. In this paper we show that the ``mate-in-$n$'' problem for Magic is $\Delta^0_n$-hard and that optimal play in two-player Magic is non-arithmetic in general. These results apply to how real Magic is played, can be… CONTINUE READING

    Tables and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    Monte Carlo search applied to card selection in Magic: The Gathering

    Constraint Logic: A Uniform Framework for Modeling Computation as Games

    Magic is Turing complete (the Turing machine combo)

    • Alex Churchill
    • 2014

    Magic: The Gathering comprehensive rules

    • Wizards of the Coast