OK. I’m the only one to get excited by this… but there is a proof that Rasende Roboter (Ricochet Robots in the USA) is an NP-Complete problem! It’s weird. When you are given an NP Complete problem.. you can feel as a sixth sense that it’s NP Complete. But finding the proof is ofter quite harder 
Read about it here.
by lahgrooto
"Hello, i read your site, this a best site from me, thanks! "by Jessie
"Jessie Thanks for the nice read, keep up the interesting posts.. "by Vikenti Potapov
"Have a problem: When developing with VS 2005, .NET 2.0 and trying to use assembly DevIL.NET2 (DevIL version 1.3) have an ..."
by Marco Mastropaolo
"Thanks to you! :) "