I have a generally-applicable approach, i.e., a coin with any number of sides and any probabilities. Here we go, in the spirit of brute force: 0. Train your wr

I have a generally-applicable approach, i.e., a coin with any number of sides and any probabilities. Here we go, in the spirit of brute force: 0. Train your wrist, 'cause you'll be flipping this a gazillion times (say just N times) 1. Enumerate all possibilities, i.e., sample space = {H, T}^N 2. Compute the probabilities of each. 3. Partition the sample space into two such that the total probability (sum of probabilities) is equal to 0.5. 4. Call one element of the partition heads and the other tails. 5. Want a "multi-sided-coin"? Go back to step 3 and create a finer partition.