News for hackers. Stuff that matters.
Re:Pac-Man Proved NP-Hard by joshAg on Thursday January 26, 2012 @08:13PM (#3516782)
Perfect thanks! not obscure at all; i did the inverse of the transform i was supposed to do.

Now it's clearer why he used a form of Pacman where pacman could only visit each node once, and why it's not as trivial as i made it seem.

There are no comments on this comment yet.