Tag Info

New answers tagged

0

Here is a specialization of this answer that is efficient in term of average entropy loss, and easily implemented. Let $n$ be the number of faces on the dice ($n=6$ for a common dice). Let $b$ be the minimum value on the dice ($b=1$ on a common dice). Let $m$ be some large integer with $m≥n^2$. No value used will exceed $m$. Set $r←0$, $s←1$. If $s$ is ...



Top 50 recent answers are included