When a developer makes a game by coding it, he is bound to choose one of the available algorithms in the field. These algorithms help the game process all the gathered data from a play, and determine a winner out of a group of players. But this isn’t the case with Magic: The Gathering, as the experts say we still don’t have an algorithm that can process the game and determine a winner.
This is a Card Game
In case you’re still wondering what we’re talking about, Magic: The Gathering is a card game, in which two or more players transform into wizards, and each player has 60 or more cards to play to fully drain the energy of their opponent.
But this isn’t as simple as it sounds. Because the company behind this game has released over 20,000 cards over the years to keep the game interesting and compelling to more new players. It also has one of the most complex set of rules, and that makes it even more difficult to develop.
Why It Cannot Be Developed?
Lets take a look at some facts first. A student of computer science is always determined to measure a certain task’s complexity, and see that in how many ways it can be solved by the computer, this is called the measurement of computational complexity. This article named Magic: The Gathering” – Too Complex For PC Gaming Motherboards further elaborates the issue to give you more information.
From the experiments done so far to get the computational complexity of Magic: The Gathering, it is regarded as the most complex real world game to date, and so, no algorithm can help us successfully develop the game for fully digital use. You can search more about this topic online.