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.
JBomb published
I’ve published JBomb, a little java game I wrote for the university. This is an academic project, however you can still be able to reap some fun out of it. Also you have full sources and documentation, albeit in Italian.
June 2, 2005 | Filed Under Gaming | Comments Off
