Back to all submissions
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.
Comments for this submission are closed. View the software in juesato's portfolio to continue the conversation.
0 comments