Earlier quoted context omitted.
mtg is more recent than things like the johnniac, but plausibly there's a traditional card game with the same criteria that predates electronic computation but then we have to ask thorny ontological questions: does a card game count if it requires a particular configuration to be turing-complete, but nobody ever played it in that configuration? what if nobody ever played the game at all? what if nobody even knew the…
The MtG preprint suggest people have been looking for such games but failed to identify any. From "Previous Work", first page, column 2: > Prior to this work, no undecidable real games were known to exist. Demaine and Hearn (2009) [10] note that almost every real-world game is trivially decidable, as they produce game trees with only computable paths. They further note that Rengo Kriegspiel {Rengo Kriegspiel is a com…
well, maybe one thing: if it doesn't matter whether anyone played the game or knew the rules, then magic: the gathering was turing-complete before the first magic deck was printed, before the first human was born, before the first star was formed, perhaps before the big bang