That virtually impossible classic compsci P vs NP problem is virtually impossible, say boffins

$1m prize is still up for grabs if you want to prove them wrong

A trio of computer scientists from the University of St Andrews in Fife, Scotland, has published results showing that a classic chess puzzle dating back 150 years is so computationally taxing that it could take thousands of years to solve."