I am trying to come up with a workable question but every question I have looked at so far has been one where the winning answer is "fewest bytes in your language".
By "fewest bytes in x language", I mean this:
- Answer: Mouse-2002, 4 bytes.
- Answer: Python, 52 bytes
- Answer: Befunge 8 bytes
- Answer: Ruby, 15
- Answer: Go, 2 bytes (UTF-16)
Wondering if one could list some examples where that is not the case. I asked one a while back where it was about "fewest clock cycles", and it got decent votes. However, it seems that if I asked that same question today it would be flagged as "shouldn't limit to a specific language" (since it was all about x86 assembly). But in limiting it to a language it made it possible to come up with a winning condition, because with assembly you can limit to only primitive instructions (i.e. no libraries can be used) pretty easily.
I am having a hard time finding an example of a question that would be considered valid that isn't "shortest x in your language".
For example, every question here is "shortest x in your language":
As of now I have only found 3 types of winning conditions:
- Shortest in x language.
- Popularity contest (win by votes).
- Playing a game (win by seeing how high a score your algorithm can achieve, either by testing against test data, or actually playing some game).
Popularity contest has issues with early posts getting more votes. Shortest x language has issues in that it can be played by just using an esolang. So that leaves it down to "Playing a game". But that one is quite involved and requires a lot of effort on the part of the asker and answerer. So not sure what to do.