- #1
KarateMan
- 13
- 0
hi, I am writing a computer algorithm which descibes the change of choice.
1.your friend puts $10 in a box among three (there are three boxes) but you don't know which.
2.you choose one of them but do not open it.
3.your friend opens (eliminates) one of empty boxes
i.e. if you choose the lucky box, he eliminate either one of two empty boxes at equal probability
and if you choose an unlucky one, he eliminates the empty remainder.
4.then you decide, whether or not you change your choice between two remainings.
5.repeat 1~4 many times and expect the maximum result(in $).
Question: you'd better change your choice? or should not change? for the maximum outcome.
I expected that the change of choice should not matter: the equal probabilities.
but my computer algorithm tells that "if you change the choice, better"
Can someone tell me whether I am wrong or my algorithm is wrong?
1.your friend puts $10 in a box among three (there are three boxes) but you don't know which.
2.you choose one of them but do not open it.
3.your friend opens (eliminates) one of empty boxes
i.e. if you choose the lucky box, he eliminate either one of two empty boxes at equal probability
and if you choose an unlucky one, he eliminates the empty remainder.
4.then you decide, whether or not you change your choice between two remainings.
5.repeat 1~4 many times and expect the maximum result(in $).
Question: you'd better change your choice? or should not change? for the maximum outcome.
I expected that the change of choice should not matter: the equal probabilities.
but my computer algorithm tells that "if you change the choice, better"
Can someone tell me whether I am wrong or my algorithm is wrong?