mario

Tom Murphy's satirical SIGBOVIK 2007 presentation, delivered under a pseudonym, proving that generalized Super Mario Bros. is NP-complete. It is a short, deadpan take on a complexity theory result.

A bot built by Robin Baumgarten plays Infinite Mario using A* path-finding, shown as a red planned path that updates as new obstacles appear. It won the Mario AI competitions and uses only on-screen information.