> We can prove that in an ideal situation, the die roll will be fair. Assuming both parties can come up with unbiased random numbers ranging from [0;12)...
Doesn't that assumption remove the entire problem though? I thought the whole reason for the method was that people can't easily think of an unbiased random number.
Or put differently, if that's your starting point, what's stopping you from simply doing (A mod 6) + 1?
I think the game theory inherit here makes it ok for this purpose. You get an advantage being random. You're likely still not going to generate random numbers but at least there's good motivation to be random and that part just becomes part of the game imho (guess what number the opponent calls to maximize your roll).
Of course as others note this is a convoluted mod n process.
Yeah, the only valuable idea here is the angle-one, which is like a modulo, making the approach a primitive LCG, which is a way of generating pseudorandom numbers from seeds.
I'd say the only unbiased and non crappy method here is to feed the 2 participants' numbers into some sorth of hash function.
Because you can rig the answer if it's just one person. But if two of you use the method from the post, and both commit to your answers before revealing them, then neither of you can rig it.
That assumes "rigging" is the only non-random component. There's also unintentional bias; when asked to name a random number between 1-100, multiples of ten are underrepresented due to our bias.
This starts by assuming humans are bad at coming up with unbiased numbers but then requires them to do so. I don’t get how this could work with biased inputs.
Bear in mind, the terminal goal doesn't actually require unbiased numbers; the way most TTRPGs work is that you're trying to roll over or under a target number to get a weighted, unpredictable outcome. The idea is that while players (usually) want any given action to succeed, they some of their actions to fail in order to preserve narrative interest, while having their character be better at some things than others.
As such, while randomness is best, the given method is quite sufficient for having fun, and both players can agree that it's fair: they each have equal influence over the result.
I think it depends on the roll. For two players against each other it’s a bit more fun, but dm/player feels imbalanced, even when it’s character based. Th player winning might feel more fun beating another character with wits but that doesn’t work as well imo for luck, strength, or against something inanimate. It also moves success into a personal skill of the player vs the dm. I don’t agree that it’s necessarily fair.
Perhaps it’s just the feeling of “I took a risk and it didn’t work” vs “I chose badly and was outsmarted by the dm” seem different to me in an important way.
You could reframe this all easily as well for “I’m thinking of a number between 1 and 100, guess it within Y distance to succeed”. That’s mathematically equivalent I think, if you allow it rolling around.
An alternative, because the use of dice is to effectively decide an outcome: for example, Knight (Player1) fights Troll. Have both players agree on a short set of possible outcomes. For this example:
1-Knight defeats Troll
2-Troll defeats Knight
3-Troll is wounded but escapes
4-Knight is wounded but escapes
5-Another character or party comes into scene
Then Player2 decides which outcomes are assigned to which numbers (1-5), keeping them a secret and Player1 picks a number not knowing the outcome it stands for.
It's quicker and within reach of us, mere mortals.
You could draw long/short straws to generate bits but since the challenge limited the tools to mortal bodies any other guessing game would do.
One could put his hands behind his back with one hand palm open and the other hand in a fist. The other one then guesses which hand is open and him being right or wrong generates either a 1 or 0. Repeat N times for an N-bit binary number. Both players can influence their choice equally and also equally make assumptions about the other player's intentions when making their own choice.
(However, if the stakes are high enough, the party that learns the outcome first can choose to exit the protocol if they are unsatisfied with the result.)
If you're worried about someone exiting the protocol, you can use a smart contract to lock their funds so that if they simply exit then they lose all their money.
You could just play rock paper scissors three times and use the results as bits for d6? Maybe dropping 111 and alternating who is 1?
Edit, I realize you’d have to drop 111 and 000 to get 6, not sure what I had in mind in the original, either way it balances. It’s also nice because I don’t think you can intentionally lose rock paper scissors.
There actually are techniques to win (and presumably lose) rock paper scissors more frequently than random due to psychological factors that make player choices somewhat predictable.
If you have a coin: Heads and tails represent bits. Flip a coin three times and add up the result to emulate a six-sided dice roll. e.g., heads, heads, tails = 3. If you get 7, then try again.
I saw some gamebook for two players many years ago that had a small 5x5 table printed on each page. When players needed a random number 1-5 they simultaneously revealed a hand showing 1-5 fingers and used the table on the current page to cross-reference to get a number .
Of course it would work fine without the table, just using simple maths, but I think having unique tables on each page to scramble the result removes some of the ability of players to try to mind-game each other.
It would not work as well for ranges other than 1-5.
> Assuming both parties can come up with unbiased random numbers
When you're in competition, this cannot be assumed. You'll each bias the numbers you come up with towards your preferred outcome. Even with A + B mod N, you can still bias the results when you know what your opponent is trying for.
A fairer approach would be to make a long series of randomized values. Your opponent secretly chooses a starting offset, and you pick an offset to add.
I think you need 0-5 to avoid bias. (If you are good at generating random 0-9, then you are biasing 0-4 over 5-6, in the mod-6 regime, and I can preserve that bias by preferring to choose small or large numbers depending on whether I want a small or large result)
This explanation with angles makes this seem more complicated than it is. Two adversaries think of two numbers 0-11. Both say one aloud, add the other person's number to the one that wasn't said, then subtract 12 if it's higher.
As a bonus, the other person doesn't know what you "rolled" unless you tell them, which was important for the game I was making.
Probably beside the point because I imagine the author just wanted to show a neat math-based solution, but in this situation with no dice available I've just used playing cards. If you want to simulate a 6-sided dice roll you grab cards 1-6 and shuffle, nice and simple
Another procedure based on a similar problem I worked on with a friend: you both pick positive integers a and b, then add them together to create c. Either sqrt(c) or sqrt(c+1) is irrational and the fractional digits provide your random numbers. If you need a new sequence, you take some digits from the current expansion and sqrt() them again.
Even without a formal proof you could test it empirically if you generate a large number of samples and run regular tests for pseudorandom number generators. [Edit: a quick test on a million samples and relatively simple RNG tests suggests that this is indeed good enough; maybe worth working out a proof if this hasn't been done already. Edit2: I guess the main problem you'd hit in practice with short sequences of digits would be to avoid accidental recurrences with too short a period, but it should be possible to make it statistically unlikely in practice with enough compute/digits.]
I'm not entirely sure what algebraic property you would prove with this, but you probably could prove something about it. The issue is that they have repeating continued fraction representations, and large numbers in the continued fraction correspond to very good rational approximations, and so you'd find that a bunch of these chosen at random have pretty good rational approximations, which assuming the denominator is co-prime to 10, probably means that it explores the space of digits too uniformly? Something like that.
The approach I was thinking of is that you'd prove normality or the lack thereof, a notoriously open problem for virtually all irrational roots. Continued fractions might be fruitful, but I suspect you'd eventually run one of the many other open problems in that space instead.
This looks srsly overengineered. There's an easier way.
Each player chooses simultaneously an integer from [1, N]. (Like, draw a chit and reveal them simultaneously.) Sum the draws. For a sum of N+1 or more, subtract N.
> We can prove that in an ideal situation, the die roll will be fair. Assuming both parties can come up with unbiased random numbers ranging from [0;12)...
Doesn't that assumption remove the entire problem though? I thought the whole reason for the method was that people can't easily think of an unbiased random number.
Or put differently, if that's your starting point, what's stopping you from simply doing (A mod 6) + 1?
I think the game theory inherit here makes it ok for this purpose. You get an advantage being random. You're likely still not going to generate random numbers but at least there's good motivation to be random and that part just becomes part of the game imho (guess what number the opponent calls to maximize your roll).
Of course as others note this is a convoluted mod n process.
Does seem like each person could just secretly write down any number, they are revealed, added and mod 6'd.
Is all this angular difference stuff a fancy way of saying mod 6?
Yes.
Yeah, the only valuable idea here is the angle-one, which is like a modulo, making the approach a primitive LCG, which is a way of generating pseudorandom numbers from seeds.
I'd say the only unbiased and non crappy method here is to feed the 2 participants' numbers into some sorth of hash function.
Because you can rig the answer if it's just one person. But if two of you use the method from the post, and both commit to your answers before revealing them, then neither of you can rig it.
That assumes "rigging" is the only non-random component. There's also unintentional bias; when asked to name a random number between 1-100, multiples of ten are underrepresented due to our bias.
It solves the rigging problem, it doesn't necessarily make claims as to whether that is the only problem that exists.
This starts by assuming humans are bad at coming up with unbiased numbers but then requires them to do so. I don’t get how this could work with biased inputs.
Bear in mind, the terminal goal doesn't actually require unbiased numbers; the way most TTRPGs work is that you're trying to roll over or under a target number to get a weighted, unpredictable outcome. The idea is that while players (usually) want any given action to succeed, they some of their actions to fail in order to preserve narrative interest, while having their character be better at some things than others.
As such, while randomness is best, the given method is quite sufficient for having fun, and both players can agree that it's fair: they each have equal influence over the result.
I think it depends on the roll. For two players against each other it’s a bit more fun, but dm/player feels imbalanced, even when it’s character based. Th player winning might feel more fun beating another character with wits but that doesn’t work as well imo for luck, strength, or against something inanimate. It also moves success into a personal skill of the player vs the dm. I don’t agree that it’s necessarily fair.
Perhaps it’s just the feeling of “I took a risk and it didn’t work” vs “I chose badly and was outsmarted by the dm” seem different to me in an important way.
You could reframe this all easily as well for “I’m thinking of a number between 1 and 100, guess it within Y distance to succeed”. That’s mathematically equivalent I think, if you allow it rolling around.
An alternative, because the use of dice is to effectively decide an outcome: for example, Knight (Player1) fights Troll. Have both players agree on a short set of possible outcomes. For this example:
1-Knight defeats Troll 2-Troll defeats Knight 3-Troll is wounded but escapes 4-Knight is wounded but escapes 5-Another character or party comes into scene
Then Player2 decides which outcomes are assigned to which numbers (1-5), keeping them a secret and Player1 picks a number not knowing the outcome it stands for.
It's quicker and within reach of us, mere mortals.
You could draw long/short straws to generate bits but since the challenge limited the tools to mortal bodies any other guessing game would do.
One could put his hands behind his back with one hand palm open and the other hand in a fist. The other one then guesses which hand is open and him being right or wrong generates either a 1 or 0. Repeat N times for an N-bit binary number. Both players can influence their choice equally and also equally make assumptions about the other player's intentions when making their own choice.
Usually, commitment schemes are used for this: https://en.wikipedia.org/wiki/Commitment_scheme
(However, if the stakes are high enough, the party that learns the outcome first can choose to exit the protocol if they are unsatisfied with the result.)
I think mine from 2017 is a commitment scheme. Certainly is not unique or novel.
https://darkcephas.blogspot.com/2017/07/fair-random-number-g...
If you're worried about someone exiting the protocol, you can use a smart contract to lock their funds so that if they simply exit then they lose all their money.
It would be more interesting to look at how much this reduces bias based on numbers humans actually tend to generate.
BTW a "classic" method of generating random numbers is to look at the second hand of a watch mod n.
You could just play rock paper scissors three times and use the results as bits for d6? Maybe dropping 111 and alternating who is 1?
Edit, I realize you’d have to drop 111 and 000 to get 6, not sure what I had in mind in the original, either way it balances. It’s also nice because I don’t think you can intentionally lose rock paper scissors.
There actually are techniques to win (and presumably lose) rock paper scissors more frequently than random due to psychological factors that make player choices somewhat predictable.
Which emphasizes the innate problem in using biased inputs (human choice) to generate unbiased outputs.
It is virtually impossible.
If you have a coin: Heads and tails represent bits. Flip a coin three times and add up the result to emulate a six-sided dice roll. e.g., heads, heads, tails = 3. If you get 7, then try again.
If you get all heads or all tails then use the last toss as part of your next set of 3.
E.g. HHHHT -> HHT -> 6
Ah yeah of course, there is a zero case as well. I was thinking you just restart as to not bias the result. That's an interesting alternative though
That will make HHH always 6 and TTT always 1
HHH becomes H
Then depending on the next 2 throws
HH -> keep going
HT -> 6
TH -> 5
TT -> 4
For TTT similar with K,1,2,3
A + B mod n seems much easier than this.
The method proposed is just A - B mod n. The two are entirely equivalent.
A few extra steps to essentially manually do the mod part tbh. Would take their 20 line program to a 1 liner.
Yup
After a while both people will get tired or bored and start generating the same number over and over again. At which point the method breaks down.
Add a CTR!
I saw some gamebook for two players many years ago that had a small 5x5 table printed on each page. When players needed a random number 1-5 they simultaneously revealed a hand showing 1-5 fingers and used the table on the current page to cross-reference to get a number .
Of course it would work fine without the table, just using simple maths, but I think having unique tables on each page to scramble the result removes some of the ability of players to try to mind-game each other.
It would not work as well for ranges other than 1-5.
> Assuming both parties can come up with unbiased random numbers
When you're in competition, this cannot be assumed. You'll each bias the numbers you come up with towards your preferred outcome. Even with A + B mod N, you can still bias the results when you know what your opponent is trying for.
A fairer approach would be to make a long series of randomized values. Your opponent secretly chooses a starting offset, and you pick an offset to add.
So for 1d6:
You don't need a ton of rows. Each possible roll value must appear once in each row.Your opponent places a marker on one of those numbers and keeps that information hidden.
- Let's say they choose the "1" at row=2, col=5.
Now you pick a number from 1 to 6.
- Let's say you choose 5.
Now they reveal where the marker is set (row=2, col=5).
Now you advance from the marker by 5 (wrapping around in the row if necessary).
- so from row=2, col=5, you advance by 5 like so: 6, (wrap) 4, 3, 5, 2 (ending at row=2, col=4).
You "rolled" a 2.
> Assuming both parties can come up with unbiased random numbers ranging from
Oh shame I though you were going to solve that problem.
Sounds like a bit more complicated odds-and-evens. Rather than mess with pi and circles, you could just cast 0-9 fingers and get mod 6 + 1.
I think you need 0-5 to avoid bias. (If you are good at generating random 0-9, then you are biasing 0-4 over 5-6, in the mod-6 regime, and I can preserve that bias by preferring to choose small or large numbers depending on whether I want a small or large result)
You must be somewhat right, however only 4 gets biased up:
In [18]: n = 10000000
In [19]: tally = [0,0,0,0,0,0]
In [20]: for i in range(n): ...: tally[(random.randint(0,9)+ random.randint(0,9))%6]+=1 ...:
In [21]: tally Out[21]: [1600008, 1600460, 1699599, 1799697, 1699604, 1600632]
This explanation with angles makes this seem more complicated than it is. Two adversaries think of two numbers 0-11. Both say one aloud, add the other person's number to the one that wasn't said, then subtract 12 if it's higher.
As a bonus, the other person doesn't know what you "rolled" unless you tell them, which was important for the game I was making.
This appears to be equivalent to playing rock-paper-scissors to generate a random bit stream.
Probably beside the point because I imagine the author just wanted to show a neat math-based solution, but in this situation with no dice available I've just used playing cards. If you want to simulate a 6-sided dice roll you grab cards 1-6 and shuffle, nice and simple
Another procedure based on a similar problem I worked on with a friend: you both pick positive integers a and b, then add them together to create c. Either sqrt(c) or sqrt(c+1) is irrational and the fractional digits provide your random numbers. If you need a new sequence, you take some digits from the current expansion and sqrt() them again.
Might not be unbiased, but good luck proving it.
Even without a formal proof you could test it empirically if you generate a large number of samples and run regular tests for pseudorandom number generators. [Edit: a quick test on a million samples and relatively simple RNG tests suggests that this is indeed good enough; maybe worth working out a proof if this hasn't been done already. Edit2: I guess the main problem you'd hit in practice with short sequences of digits would be to avoid accidental recurrences with too short a period, but it should be possible to make it statistically unlikely in practice with enough compute/digits.]
Passes dieharder and PractRand, so it's pretty dang good.
Yeah I like the simplicity and power of it. You might want to tackle the math and write it up.
I'm not entirely sure what algebraic property you would prove with this, but you probably could prove something about it. The issue is that they have repeating continued fraction representations, and large numbers in the continued fraction correspond to very good rational approximations, and so you'd find that a bunch of these chosen at random have pretty good rational approximations, which assuming the denominator is co-prime to 10, probably means that it explores the space of digits too uniformly? Something like that.
The approach I was thinking of is that you'd prove normality or the lack thereof, a notoriously open problem for virtually all irrational roots. Continued fractions might be fruitful, but I suspect you'd eventually run one of the many other open problems in that space instead.
You need to go mod 10^(-n) to avoid the bias in the first digits.
I'd prefer that one person choose a non-square integer, and the other choose (very large) n.
Can you calculate the digits in your head without help?
This looks srsly overengineered. There's an easier way.
Each player chooses simultaneously an integer from [1, N]. (Like, draw a chit and reveal them simultaneously.) Sum the draws. For a sum of N+1 or more, subtract N.