Hi everyone,
On this Friday, March 10, I'll be shutting down the web server that runs the "Distributed Chaffin Method" superpermutation search. Even though we were not able to fully solve the n=6 case, I'm deeply grateful to everyone who was able to contribute computer time and power to the search.
We knew from the beginning that there was no guarantee that the problem would be solvable and after well over 100 million CPU hours, we've been stuck on the waste=122 case for a year and a half. I am hopeful that there will be some theoretical advance in the future that proves the n=6 superpermutation is optimal, or that at least speeds up the search.
Best wishes,
Jay