Looking through the questions today, I see, rather disappointingly, that of first 4 questions one is a duplicate and 3 are on hold and absolutely cannot be saved.
But further down, I see this question, posted by a new user: Convert integer to string preserving order
There was much discussion about what was actually meant by "string" and the asker finally settled on UTF-8 (far more interesting than 8 bit ASCII.) However the reason this is on hold is because it does not have an objective winning criterion.
But the stated winning criterion, with a few minor edits as indicated below to iron out inconsistencies, would be quite clear:
The answer must fulfill the conditions above
The main goal is to make f(X) to represent the number in the least number of
bytesUTF-8 unicode characters, assuming X is distributed uniformly.
In case of draw, smallest code wins (sum of code of f and code of g)
So really, this is a code-golf question in disguise. The existing answer produces 5 unicode characters. Unfortunately I don't know enough about Unicode to confirm that is the minimum required (though obviously there is a fixed number), so the least-characters criterion should stay, making code-challenge the right tag.
Then we have this question: How many paths are available?
The question was already showing a small number of downvotes, I believe because people thought it was a lot of tedious effort to handle the big numbers. So I suggested hex to make it easier. The OP then allowed basically any form of output format which was too broad. A couple of close votes came in, but even after the OP fixed the output format, close votes still kept coming in. Why? The text is now as follows
Output will be the number of possible paths in either a string or hex
Admittedly this can be improved on. I would prefer the following, with or without the hex:
Output will be a string containing the number of possible paths in decimal or hex format.
I now regret mentioning hex, because of what happened. Also, regarding the linked question big integer multiplication I found a way to answer the question without multiplying. My entire ungolfed C program (posted in the comments on the question as I am unable to post it as an answer) is actually shorter than most of the answers on that linked question, proving that it is not a duplicate. (In fact, I would love to see if someone can beat me using big integer multiplication in any language!)
Now, the two questions I mention here (and many that have gone before them) have potential. So I will go ahead tomorrow and make the minor edits I propose. But are the close voters ever going to come back and re-evaluate? The problem is, once the questions are closed, they receive very little traffic and no-one is around to reopen them. Even the question askers seem to have given up. Is there anything that can be done about this?
Another issue is that many people (including me) do not know how to cancel a close vote once cast.
By the way, the fact that a question seems hard (but not impossible) is not in my opinion a reason to downvote. The Alphanumeric Hello World question received a lot of downvotes before the rules were relaxed, and although it is now very popular, it still carries a fair number of those downvotes, because people have not re-evaluated. The top two answers, while not sophisticated in terms of algorithm, are both very clever in terms of syntax.