[g-harel]

Not sure how much it could add to the conversation, but I implemented a library to find almost minimal superpermutations in go a while back. Uses a technique I didn't see anywhere else.

https://github.com/g-harel/superpermutations

[robinhouston]

The technique may be different, but the results seem to be identical to what you get from the standard method e.g. described in Section 2 of http://www.njohnston.ca/wp-content/uploads/2013/03/minimal_s...; or section 1 of https://arxiv.org/pdf/1408.5108.pdf; or as implemented by https://github.com/superpermutators/superperm/blob/master/bi...

This method produces superpermutations of length 1! + 2! + ... + n!, which was believed for a long time to be the best possible. But Greg Egan’s new result shows it’s possible to do a lot better than that.

[selimthegrim]

It looks like 4chan had us all beat according to Robin Houston

https://threadreaderapp.com/thread/1054637891085918209.html

https://news.ycombinator.com/item?id=18292061

[JdeBP]

One person in the 4chan discussion suggested writing an answer at https://math.stackexchange.com/questions/15510/ .