PDA

View Full Version : Pac-Man is NP-hard, same as traveling salesman problem - ExtremeTech



RetromanIE
26-01-2012, 12:57
http://www.retrovia.ie//nt0.ggpht.com/news/tbn/DO4KiVNRfWEo1M/0.jpg
ExtremeTech (http://news.google.com/news/url?sa=t&fd=R&usg=AFQjCNFLjNGMnMYHOsAlDJswGHXCiMldYA&url=http://www.extremetech.com/gaming/115677-pac-man-is-np-hard-same-as-travelling-salesman-problem)
<img alt="" height="1" width="1" />
Pac-Man is NP-hard, same as traveling salesman problem (http://news.google.com/news/url?sa=t&fd=R&usg=AFQjCNFLjNGMnMYHOsAlDJswGHXCiMldYA&url=http://www.extremetech.com/gaming/115677-pac-man-is-np-hard-same-as-travelling-salesman-problem)
ExtremeTech
By Sebastian Anthony on January 26, 2012 at 8:38 am An Italian researcher with a penchant for retro games — or perhaps just looking for an excuse to play games in the name of science! — has used computational complexity theory to decide, ...

[/URL]


[url=http://news.google.com/news/url?sa=t&fd=R&usg=AFQjCNFLjNGMnMYHOsAlDJswGHXCiMldYA&url=http://www.extremetech.com/gaming/115677-pac-man-is-np-hard-same-as-travelling-salesman-problem]More... (http://news.google.ie/news/more?pz=1&ned=en_ie&ncl=dBEYEG_kSpgtfxM)