Rasende Roboter (Ricochet Robots) complexity
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.
August 13, 2007 | Filed Under Gaming, Geeky side of life