3 ms·
I misinterpreted your algorithm. So you're creating a table of all permutations given the number of heads and tails you got, and then looking it up in the table
by aqme28 5y ago
I misinterpreted your algorithm. So you're creating a table of all permutations given the number of heads and tails you got, and then looking it up in the table.
This does feel like a generalization of Von Neumann's method from 2 tosses to 1000
- eru 5y agoYes, you can view it like that. Basically we have 1001 tables, for each amount of heads that are possible. If you are sufficiently clever, you can generalize it to an indefinite stream of tosses, and produce output as you go along. See some of the papers mentioned elsewhere in the comments.