Superpermutation Almanac

Back to n = 12

W-0091

A superpermutation on 12 symbols, found by William Echols. It beat the previous record W-0074 by 466 letters and was the record on Nov 9, 2026. The next record W-0093 beat it by 2 letters.

Length
522,736,503
Repeated permutations
177,377
Received
Nov 9, 202608:09:12 UTC
Begins 0123456789AB0123456789A0B123456789A01B23456789A012B3456789A0123B456789A01234B56789A012345B6789A0123456B789A01234567B89A0…

Windows

522,736,492windows of 12 consecutive letters
=479,001,600distinct permutations
+177,377repeated permutations
+43,557,515windows that are not permutations

Detours by weight

A step is the move from one permutation in the superpermutation to the next permutation in it, and its weight is the number of letters added in that move. A detour starts at a step that differs from the next step of the recursive construction, and ends at the first permutation after that whose next step has weight 1. The weight of a detour is the number of letters added in it. After each detour, we consider the recursive construction to begin again from scratch at the permutation where the detour ends.

WeightDetours
10
20
31,065,446
4459
5551
61,081
733
824
932
1022
116
121

How it was found

From the submitter

Jakub Halfar's plan for his 522,736,969 word, improved with his unchanged trailsearch.c (chained runs, to 618) and then polish.sh (loopscan, relocate --dpa, segins --or3). His selection and closed trails are unchanged. Made with Claude Opus 5.5 in Claude Code.

Download

Learn about the Detour file format

Download Detour (.detour) 41.6 kB, or 522.7 MB decoded