lzgolf
a daily byte-golf puzzle
encode this string
your program
how to play
You write a tiny program that must decode to the target string exactly. Shorter is better. Beat par if you can. Par is provably optimal, so beating it is impossible; matching it is a perfect round.
| token | meaning | example |
|---|---|---|
| plain text | prints itself (1 char each) | abc → abc |
N{...} | repeat the block N times | 4{ab} → abababab |
~D,L~ | copy L chars from D back | abcd~4,2~ → abcdab |
\x | literal x (for digits, { } ~ \) | \7 → 7 |
Backrefs copy from the decoded output as it grows, so ab~2,4~ gives ababab.
Inside a { } block, a backref can only see inside that block.