(This is a follow-up to Revealing the least helpful of three numbers.)
The game is like last time, but with one new step.
- Andrew is secretly shown three real numbers, all independently, randomly, uniformly chosen from the interval [0, 1].
- He must pick one to go in a transparent box. The other two go into opaque boxes.
- Then Bndrew enters the room, and sees the number in the transparent box.
- New Step: Andrew must tell Bndrew one of the numbers in the opaque boxes. Andrew chooses which of the two hidden numbers to divulge. He doesn't have to tell Bndrew which opaque box contains this number.
- Bndrew guesses which of the three boxes contains the highest number. If he gets it right, he wins; otherwise Andrew wins.
Each player plays optimally (by which I mean they choose a strategy which maximises their win percentage under the assumption that the other player chooses the best possible counter-strategy). How likely is Bndrew to win?