Inspired by Matt Parker's video, I wrote some code to play the superpermutation for \(n = 7\), length \(5906\).
A superpermutation is a string formed from a set of \(n\) symbols, such that every one of the \(n!\) permutations of those symbols appears at least once as a contiguous block of \(n\) characters in the string.
Read more about superpermutations in Greg Egan's article.
