Can I Predict the Correct Dice Using Probability Distributions?

  • Thread starter Thread starter aaaa202
  • Start date Start date
  • Tags Tags
    Dice
aaaa202
Messages
1,144
Reaction score
2
Say I have two dice which have different probability distributions but I don't know which probability distribution belongs to what dice.
I now throw one of them exactly one time and the result is x. I know that die A has probability pA(x) for rolling x and die B has probability pB(x).
I want to find out if the die I rolled was die A or B. Obviously my best strategy is to guess the die for which the probability for rolling x is the bigger. But what is my probability for being correct? I have been trying to figure out this problem for days. Obviously if pB(x)=0 while pA(x)>0 I have 100% chance of being correct. Moreover if pB(x)=pA(x) then I have 50% chance of being correct. But is there an expression for arbitrary probabilities and how do I find it?
 
Physics news on Phys.org
Nice question. This would be a perfect application for Bayesian inference.

Are you familiar with Bayes theorem?
 
Yes P(XlY) = P(YlX) * P(Y)/P(X)

So in my case P(Alx) is the probability that the die is A given that it shows x, while P(xlA) is the probability that the die shows x given that it is die A and P(A) is the probability that it is die A given no prior information, i.e. P(A)=0.5 and P(x) is then the probability for tossing an x given no prior information, which would be 0.5*(pA(x)+pB(x)).. hmm.. is that correct?
 
Yes. I think that is correct.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top