News for hackers. Stuff that matters.
Re:The envelope paradox (2006) by mjd on Monday November 30, 2015 @12:20AM (#10647883)
Rolling 1d20 doesn't work, because if the first player always chooses numbers bigger than 20 or smaller than 1, the second player wins with only probability ½.

To get a winning probability greater than ½ the second player needs to choose from a distribution that is everywhere positive, which means that a discrete distribution won't do.

Re:The envelope paradox (2006) by fenomas on Monday November 30, 2015 @01:26AM (#10648102)
Ah, I see what you mean - I meant that any old number will suffice for having a non-losing strategy, assuming that the opponent's strategy is unknown and undefined.