• Home
  • Now
  • RSS

HPSHELTON

Programming, Privacy, Politics, Photography

Mar 24, 2012

Mario Is Hard, and That's Mathematically Official →

An analysis of the computational complexity of video games, including those in the Mario and Legend of Zelda series, proves that many of them belong to a class of mathematical problems called NP-hard. This means that for a given game level, it can be very difficult to work out whether it is possible for a player to reach the end.

That explains a lot...

Older →

← Newer

 

Links

  • RSS
  • GitHub
  • Liked Posts
  • LinkedIn

H. Parker Shelton

I'm just an ordinary thirty-something who's had some extraordinary opportunities. I graduated from Johns Hopkins University, work for Microsoft in Silicon Valley, code websites and applications, take the occasional photograph, and keep a constant eye on current events, politics, and technology. This blog is the best of what catches that eye.

 
  • © 2010 – Present, H. Parker Shelton (Except Where Noted)
  • Hosted by GitHub Pages
  • Design by Ian P. Hines