Hacker News new | ask | show | jobs
by schoen 2202 days 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)

1 comments

Uncomputable 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_MTGW...