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