Mario has been analyzed and deemed to be an NP-hard problem by a research group at MIT – read the entire article.   This is quite humorous and something that my students will find very interesting.  We have discussed the P vs NP Problem in class several times and many find it intriguing.   This article and the research behind it will give me a reason to discuss P vs NP again.