Click here to log in
Click here to log in
Home
Popular
Search
Rank
Users
About

Thought



Main Conversations Thoughts Quotes
 
cauz June 26, 2019, 4:01 p.m.
  • 0
  • 0
  • 0
 
It’s possible to build a Turing machine within Magic: The Gathering
Just arrange a series of cascading triggers so players no longer have any choice."

Consider this hypothetical scenario: Bob and Alice are playing a game of Magic: The Gathering. It's normal game play at first, as, say, Filigree robots from Kaladesh face off against werewolves and vampires from Innistrad. But then Alice draws just the right card from her customized deck, and suddenly Bob finds himself caught in the equivalent of a Turing machine, the famed abstract device that can simulate any computer algorithm. Thanks to the peculiarities of the rules of Magic, Bob can now only finish the game when he meets whatever condition Alice has programmed her in-game algorithm to accomplish—for example, to find a pair of twin primes greater than one million.

It may be a highly unlikely scenario, but a recent paper posted on the physics arXiv proves that it's possible in principle to build a simple computer within this massively popular tabletop game using just the right combination of Magic cards. While the inputs must be pre-programmed, "Literally any function that can be computed by any computer can be computed within a game of Magic," said co-author Alex Churchill, a longtime Magic fan who has been working on the problem for several years.
Comments
There are no comments to display.