W-0005
A superpermutation on 6 symbols, found by Daniel A. Ashlock and Jenett Tillotson. It was the first record for n = 6, and held it from 1993 until Aug 21, 2014, when W-0008 was 1 letter shorter.
- Length
- 873
- Repeated occurrences
- 0
- Announced
- 1993
012345012340512340152340125340123540123045123041523041253041235041230541230145230142530142350142305142301542301245301243…
Windows
| 868 | windows of 6 consecutive letters | |
| = | 720 | distinct permutations, all 6! of them |
| + | 0 | repeated occurrences of a permutation |
| + | 148 | windows that are not permutations |
How it was found
The recursive-construction word on 6 symbols (the repository calls it 873-palindromic).
Checking
| Program | Source | Result | Time |
|---|---|---|---|
| permcheck | c46d3654 | all 720 permutations appear | under 1 s |
| literal_check | f4687121 | agrees on coverage | under 1 s |
Download
Download Detour (.detour) 124 bytes, or 873 bytes decoded
Download text (.txt) 873 bytes
# check it yourself
detour decode W-0005.detour - | tr -d '\n' | shasum -a 256
tar xzf checkers-rs-source.tar.gz && cd checkers-rs && cargo build --release --locked
./target/release/classcheck 6 ../W-0005.detour 873
./target/release/bitmapcheck 6 ../W-0005.detour 873
./target/release/wordhash 6 ../W-0005.detour 873
Decoding needs detour; see the Detour format for how to build and install it. The checkers are in checkers-rs-source.tar.gz, which needs Rust 1.89 or later; each one decodes the file itself, so the word is never written out.
The file's header gives n = 6 and sync exponent 0. The file has 2 tokens: 1 START, 1 literal of 1 byte in all, and 0 deviations. Deviations by weight, from 1 to 6: 0 · 0 · 0 · 0 · 0 · 0.