MtG is played by choosing 60 cards from 20k. Everything is finite. There must be some generalization in order to make it noncomputable.
There are probably many games that can somehow encode a halting problem if the board size is made arbitrarily large.
EDIT: This from the real abstract sounds very strange:
"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."
There are probably many games that can somehow encode a halting problem if the board size is made arbitrarily large.
EDIT: This from the real abstract sounds very strange:
"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."