3 ms·
> It even has loop detection for when you go infinite with triggers. Apparently since you can construct a Turing machine in Magic: The Gathering, this is a cas
by schoen 6y ago
> It even has loop detection for when you go infinite with triggers.
Apparently since you can construct a Turing machine in Magic: The Gathering, this is a case where halting is formally undecidable in general. :-)
(not to suggest that any actual players have ever achieved a position in real play that would be undecidable by this engine)
- whatshisface 6y agoUncomputable problems in MTG were an issue for a while but can be handily solved with this card[0]. [0] https://scryfall.com/card/pvan/304/oracle?utm_source=mw_MTGWiki https://scryfall.com/card/pvan/304/oracle?utm_source=mw_MTGW...