Possible proof emerges that P != NP... bit rusty? We explain the basic

Remember the Travelling Salesman Problem (TSP)? I hope you’re sitting comfortably. Yesterday news emerged of an HP researcher who has claimed that he has proved that P != NP. The P=NP problem is one considered so fundamental to the future study of computer science that the Clay Mathematics Institute assigned it as one of its Millenium Prize Problems, and anyone who can solve the problem is in line for $1,000,000.