For one, with e = 0.001 the algorithm N([0.64, 0.36, 0, 0, 0]) = 3 gives a wrong result. Using e = 0.0001 would give a better answer in this case. I haven't given more thought though on what e is optimal.
Though the bigger issue is the number of players can't strictly be computed based on percentages alone.
It would be nice if we could make the assumption that the least common multiple (with some leeway to account for rounding) is the correct answer, but I don't feel comfortable with that. This assumption comes from it being just past midnight and therefore ... (read more)
For one, with
e = 0.001the algorithmN([0.64, 0.36, 0, 0, 0]) = 3gives a wrong result. Usinge = 0.0001would give a better answer in this case. I haven't given more thought though on whateis optimal.Though the bigger issue is the number of players can't strictly be computed based on percentages alone.
It would be nice if we could make the assumption that the least common multiple (with some leeway to account for rounding) is the correct answer, but I don't feel comfortable with that. This assumption comes from it being just past midnight and therefore ... (read more)