An important task in computer science is to determine whether a problem can be solved in principle. “This construction establishes that Magic: The Gathering is the most computationally complex real-world game known in the literature,” they say.įirst, some background. His team has measured the computational complexity of the game for the first time by encoding it in a way that can be played by a computer or Turing machine. Today we get an answer thanks to the work of Alex Churchill, an independent researcher and board game designer in Cambridge, UK Stella Biderman at the Georgia Institute of Technology and Austin Herrick at the University of Pennsylvania. Though similar to role-playing fantasy games such as Dungeons and Dragons, it has significantly more cards and more complex rules than other card games.Īnd that raises an interesting question: among real-world games (those that people actually play, as opposed to the hypothetical ones game theorists usually consider), where does Magic fall in complexity? They choose these decks from a pool of some 20,000 cards created as the game evolved. In the game, two or more players each assemble a deck of 60 cards with varying powers. Magic: The Gathering is a card game in which wizards cast spells, summon creatures, and exploit magic objects to defeat their opponents.
0 kommentar(er)
