Skip to content
HomeVideos
AllLongsCategoriesPlaylists
BooksBlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K

    LSV Breaks MTGO

    TCGplayer

    4 HN mentions · mentioned in 3 months, 2017–2023

    YouTube

    4:57 · 323K views · May 3, 2012

    Pro Magic player Luis Scott-Vargas triggers a mandatory-action infinite loop on Magic Online, and the game stalls in a non-terminating state.

    Cited as the real-world example of an inescapable loop in Magic: The Gathering, in discussions of its Turing completeness.

    Games & Game DevelopmentChess, board games & puzzlesComputability & complexity theoryGaming culture & analysis
    1. 22:54
      I Built a COMPUTER in Magic: The GatheringBecause Science2M views • 7 years ago
    2. 1:11
      Infinite Mario AI - Long LevelRobin Baumgarten1.3M views • 17 years ago
    3. 42:36
      30 Weird Chess Algorithms: Elo Worldsuckerpinch965K views • 7 years ago
    4. 34:00
      Math's Fundamental FlawVeritasium31M views • 5 years ago
    5. 39:47
      How lucky is too lucky?: The Minecraft Speedrunning Dream Controversy ExplainedStand-up Maths8.4M views • 5 years ago
    6. 19:31
      Math MagicVsauce14M views • 10 years ago
    7. 42:43
      "Propositions as Types" by Philip WadlerStrange Loop Conference144K views • 11 years ago
    8. 16:18
      Computer program that learns to play classic NES gamessuckerpinch2.2M views • 13 years ago
    9. 7:48
      Conway's Game Of Life in APLDyalog236K views • 17 years ago
    10. 30:06
      "Tackling Concurrency Bugs with TLA+" by Hillel WayneStrange Loop Conference24K views • 9 years ago
    11. 5:34
      On The Turing Completeness of PowerPoint (SIGBOVIK)Tom Wildenhain1.2M views • 9 years ago
    12. 5:58
      MarI/O - Machine Learning for Video GamesSethBling12M views • 11 years ago
    13. 54:53
      Miguel de Icaza: Swift Godot: Fixing the Multi-million dollar mistake #GodotCon2023Godot Engine27K views • 2 years ago
    14. 1:30
      Life in lifePhillip Bradbury4.1M views • 14 years ago
    15. 4:22
      SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Completesuckerpinch84K views • 18 years ago
    16. 6:14
      Turing & The Halting Problem - ComputerphileComputerphile919K views • 12 years ago
    17. 23:12
      dotGo 2015 - Rob Pike - Simplicity is Complicateddotconferences172K views • 10 years ago
    18. 1:10:00
      The Mental Game of Python - Raymond HettingerSF Python131K views • 7 years ago
    19. 10:44
      P vs. NP and the Computational Complexity Zoohackerdashery3.7M views • 12 years ago
    20. 51:32
      Great Impractical Ideas in Computer Science: PowerPoint ProgrammingTom Wildenhain2.2M views • 7 years ago

    4 comments from Hacker News

    1. @ubernostrumNov 2017· in “Magic: The Gathering Is Turing Complete (2012)”

      There's also the infamous video of (well-known professional player) Luis Scott-Vargas "breaking" MTGO by causing the game to wind up in a non-terminating loop of mandatory actions: this video For those who are confused, the card involved there is Oblivion Ring: [LINK] Its effect is that, when it comes into play, you choose a non-land card in play that gets exiled (removed from play) for as long as Oblivion Ring stays in play, then gets returned once Oblivion Ring leaves play. This game devolves into a situation where there are three Oblivion Rings and no other non-land cards, so: Ring 1 exiles Ring 2, which returns Ring 3, which exiles Ring 1, which returns Ring 2, which exiles Ring 3, which returns Ring 1, which exiles Ring 2, and so on to infinity. The rules state that when a loop like this occurs (which is not often in real play), the game is an automatic draw.

      CitesView on HN
    2. @rcxdudeJun 2020· in “How the Magic: The Gathering Color Wheel Explains Humanity”

      That rule is exactly where the the construction used becomes interesting: it's built in such a way so that if the turing machine halts, the player who set it up wins the game. If it doesn't, by the rule above, it's a draw. So it's fundamentally impossible to tell the result of an arbitrary setup (and in practice you could set it up such that it halts iff some unknown conjecture is true). Regarding the oblivion ring loop, there's an example of it being used on MTGO, which doesn't end well (basically seems to crash the server and/or client): this video And here's the paper on the latest turing machine construction in mtg: [LINK]

      CitesView on HN
    3. @saghmJun 2020· in “How the Magic: The Gathering Color Wheel Explains Humanity”

      > Regarding the oblivion ring loop, there's an example of it being used on MTGO, which doesn't end well (basically seems to crash the server and/or client): this video Oh wow, I should have realized that somebody would try it out online just to see what happens! I'm not surprised it ends up with some sort of clash; given that it's Turing complete, the game engine obviously can't detect whether a current state will end up halting or not... > And here's the paper on the latest turing machine construction in mtg: [LINK] Awesome, thanks! I'll definitely check that out

      CitesView on HN
    4. @thomDec 2023· in “Magic: The Gathering Is Turing Complete (2019)”

      There’s never a time where players can’t interact - just passing priority or putting triggered abilities on the stack are actions. And each time this could happen the game checks state based actions to see if someone has won. That said, if both players have no options or just pass (which is more pronounced online) then you can end up in inescapable loops that cause draws. A classic example is this Luis Scott-Vargas game: this video

      CitesView on HN