basically, you write a program that takes a space separated list of integers, and outputs a sorted list. However, it's a popularity contest based on how similar the program is to english. The sentences formed don't have to relate at all to the program.
@Geobits I thought we were over "but that gives language X an advantage"? because tagging something with code-golf gives GolfScript, CJam, J and friends "quite an advantage" ;)
@NathanMerrill Even then OpenScript would do well because you could just use unrelated variable names.
@user2179021 Maybe the scoring for your challenge should have weighted the test cases differently. All but the largest two are basically negligible for the overall score.
Your boss managed to read the secret hidden message. He didn't end up firing you, though, he just made you a secretary, and forbade you from writing code.
But you're a programmer. You need to write code. You must code write code.
Therefore, your code needs to look as similar as to english a...
@NathanMerrill codegolf.stackexchange.com/a/37354 is an example of an argument for code rotations. that bot tries to trap me by putting a loop at my line 1, assuming my Start will be at line 0. Now I want to submit all of my bots rotated forward by two lines, which won't affect their behavior but WILL protect them against this specific bot.
but as soon as there are two line-targeting bots that have smart authors, we get a race condition, and whoever re-tests and re-submits the closest to the leaderboard update wins
@PeterTaylor I was trying to formalise a new quine challenge without the usual loopholes: meta.codegolf.stackexchange.com/a/2142/8478 ... the main problem is still GolfScript's 1\n. Can you think of any simple reason by which this isn't a true quine? I know you mentioned Kleene's second recursion theorem, but I'm not sure how you'd base a definition on that.
@MartinBüttner I think I said when I mentioned Kleene that basing a definition on it wasn't easy. Perhaps for the purpose of loophole avoidance it suffices to require that the program include a literal string?
Capture the flag
king-of-the-hill
Basic rules
There is a rectangular map of cells, each bot has current cell. Bots compete 1 vs 1 at a time, let's call them red and blue. There are N instances of red bot and N instances of the blue bot on the map. Additionally, there is unmovable red base and ...
anyway... of course, games without nash equilibrium are inherently more interesting, but I don't think the existence of a nash equilibrium makes a KotH boring, because there are bound to be solutions which play worse than the equilibrium which in turn means that there might be strategies which perform better than the equilibrium against the competition
Most KotH don't attract crazy numbers of submissions, let alone crazy numbers of suboptimal ones when the optimal solution is well known. A challenge whose success depends on people behaving stupidly isn't IMO a good challenge.
@PeterTaylor do you think there might be a code-challenge in this? codegolf.stackexchange.com/questions/37380/… :) (along the lines of "find the most such pairs within x minutes")