W-0002
A superpermutation on 3 symbols, found by Daniel A. Ashlock and Jenett Tillotson. It was the first record for n = 3, and is still the record.
- Length
- 9
- Repeated occurrences
- 0
- Announced
- 1993
Word
012010210
Windows
| 7 | windows of 3 consecutive letters | |
| = | 6 | distinct permutations, all 3! of them |
| + | 0 | repeated occurrences of a permutation |
| + | 1 | windows that are not permutations |
How it was found
The word 123121321 from the recursive construction; it is the unique shortest superpermutation on 3 symbols up to relabelling.
Checking
| Program | Source | Result | Time |
|---|---|---|---|
| permcheck | c46d3654 | all 6 permutations appear | under 1 s |
| literal_check | f4687121 | agrees on coverage | under 1 s |
SHA-25683da0619b095e21978b5b08d10c16b1bdddc652812d0411dbf706baf833ee290
Compilerg++ (Debian 14.2.0-19) 14.2.0
Download
Download Detour (.detour) 120 bytes, or 9 bytes decoded
Download text (.txt) 9 bytes
# check it yourself
detour decode W-0002.detour - | tr -d '\n' | shasum -a 256
tar xzf checkers-rs-source.tar.gz && cd checkers-rs && cargo build --release --locked
./target/release/classcheck 3 ../W-0002.detour 9
./target/release/bitmapcheck 3 ../W-0002.detour 9
./target/release/wordhash 3 ../W-0002.detour 9
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 = 3 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 3: 0 · 0 · 0.