Super Mario 3SAT Solver

Name: HackMIT'14
Start: 2014-10-04T11:00:00.000-04:00
End: 2014-10-08T12:00:00.000-04:00
Location: HackMIT'14

Solving one of the most difficult computational problems is as easy as playing Super Mario

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.

Try it out

0 comments

Comments for this submission are closed. View the software in juesato's portfolio to continue the conversation.

Super Mario 3SAT Solver

Solving one of the most difficult computational problems is as easy as playing Super Mario

Try it out

0 comments