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.njohnsto

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_superpermutations.pdf; http://www.njohnston.ca/wp-content/uploads/2013/03/minimal_s... or section 1 of https://arxiv.org/pdf/1408.5108.pdf; https://arxiv.org/pdf/1408.5108.pdf; or as implemented by https://github.com/superpermutators/superperm/blob/master/bin/mkpalindromic.py 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.