Inspired by the proof that Super Mario Bros is NP-Complete, we wrote a 3-SAT solver that transforms a 3-SAT problem into a playable level of Super Mario Bros.
Super Mario 3SAT Solver
Solving one of the most difficult computational problems is as easy as playing Super Mario
Updates
Leave feedback in the comments!
Log in or sign up for Devpost to join the conversation.