1
\$\begingroup\$

Most golfing languages that are competitive today use at least one string compression algorithm. My language Fig has a compressor that resembles Jelly's. I use been planning to add a super secret feature to it to make it better, however life got in the way.

Putting that aside, my failed attempt has made me wonder how compressed strings can get. Therefore, I propose outsourcing my problem creating an event where we can competitively write string compressors. I and one or two other judges will choose a few secret strings with which to test the compressors y'all submit. It may contain words, random sequences, repeating sequences, etc. We will hive a hint as to their content before the event starts. Then, y'all will have a few weeks to write a string compressor. Then, the judges will test the compressors on all the strings, and the one with the best average compression ratio wins.

This is just a rough outline to get discussion started. I have already proposed this in chat with a few positive replies. The guidelines are intentionally vague, and will change if we decide to do this. What do y'all think?

\$\endgroup\$
1

1 Answer 1

11
\$\begingroup\$

Isn't this just a challenge?

As far as I can tell, this is less of an event, and more of just a challenge, akin to this decade-old one. Events, especially chat events, tend to be on-going things that can be repeated along a theme (see Learn-a-lang or BMG). This would just be a one-off thing over a couple of weeks or so - which is just a challenge.

As for judges, I feel that part is unnecessary as either an event or a challenge. Simply choose a few set strings beforehand, and share some hash of the strings that can be used to verify that the strings are identical when revealed after scoring

\$\endgroup\$
1
  • \$\begingroup\$ Hrm, why haven't I thought of that \$\endgroup\$
    – Seggan
    Jun 2, 2023 at 18:48

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .