0
\$\begingroup\$

Is there a version of code golf that requires the most convoluted solution instead of the tersest?

I think it might be humorous (and informative) to see answers that exemplify the worst of some languages and architectures.

Rules:

  • largest code base wins
  • scoring is the same as golf (byte count, omit scaffolding (e.g. usings in c#))
  • all code must pertain to the solution (no superfluous code)

If the code base is sufficiently large, it might be better to post a gist or otherwise link to the code.

| |
\$\endgroup\$
  • \$\begingroup\$ The problem is rule number 3. We're not aware of an objective definition of "superfluous code" that effectively prevents arbitrarily large solutions. \$\endgroup\$ – Martin Ender May 26 '17 at 13:13
4
\$\begingroup\$

Yes. It's called .

| |
\$\endgroup\$
  • \$\begingroup\$ You just made my day. Thanks. Will mark as answer when I can. \$\endgroup\$ – gregsdennis May 26 '17 at 6:39
7
\$\begingroup\$

Elaborating on Mego's answer a little, the tag you're looking for is . However, there aren't that many questions with that tag, because:

  1. The challenge quickly spirals out of control with astronomical byte counts
  2. It takes a lot of effort to enforce challenges so that they don't follow 1
  3. Restraints can be somewhat ambiguous, so that ambiguity is taken out of context, which therefore turns the challenge into 1

It's a lot of effort, but if you can pull something like that off, then you've definitely got a good challenge!

| |
\$\endgroup\$
2
\$\begingroup\$

Since no one else has mentioned it, it sounds like you'd be interested in the The International Obfuscated C Code Contest. It's all about incredibly complicated, unreadable code. They don't make any claims about objectivity, they appoint judges who spend a long time working through solutions - one of the reasons they only run it every couple of years.

Some of the prizewinners are pretty amazing though - well worth a look.

| |
\$\endgroup\$
  • \$\begingroup\$ Thanks! I'll check it out. \$\endgroup\$ – gregsdennis May 28 '17 at 10:35
  • \$\begingroup\$ @gregsdennis See also the Obfuscated Perl Contest, one of the winners is mentioned in this essay (ctrl-f "Mayan") although the entire essay is worth a read. \$\endgroup\$ – Draco18s no longer trusts SE May 28 '17 at 16:14

You must log in to answer this question.

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