Sign of the times
The classic '80s arcade game turns out to be equivalent to the travelling salesman problem, according a new analysis of the computational complexity of video games
Pac-Man Proved NP-Hard By Computational Complexity Theory - Technology Review
No comments:
Post a Comment