Tag: Magic: The Gathering

Magic: The Gathering Is Turing Complete

Don’t take my word for it. Alex Churchill, Stella Biderman and Austin Herrick recently published a paper demonstrating that Magic is Turing complete.

Magic: The Gathering is a popular and famously complicated trading card game about magical combat. In this paper we show that optimal play in real-world Magic is at least as hard as the Halting Problem, solving a problem that has been open for a decade. To do this, we present a methodology for embedding an arbitrary Turing machine into a game of Magic such that the first player is guaranteed to win the game if and only if the Turing machine halts. Our result applies to how real Magic is played, can be achieved using standard-size tournament-legal decks, and does not rely on stochasticity or hidden information. Our result is also highly unusual in that all moves of both players are forced in the construction. This shows that 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. We conclude with a discussion of the implications for a unified computational theory of games and remarks about the playability of such a board in a tournament setting.

Generation Decks

This “unofficial history” of Magic: The Gathering has one of the more clever book titles I’ve seen in a long time.

Generation Decks tells the story of the mould-breaking fantasy card game, Magic: The Gathering. The brainchild of misfit maths genius Richard Garfield, Magic combines complex gameplay with collectability. When it came out in 1993 it transformed the lives of quiet braniacs who had longed for a way to connect and compete. It made millionaires of its creators, and it kick-started the era of professional gaming.

Titus Chalk tells the game’s story – from its humble origins to its continued success in today’s digital age. Prepare to meet Generation Decks, a community like no other.