You enter a special kind of chess tournament, in which you play one game with each of three opponents, but you get to choose the order in which you play your opponents, knowing the probability of a win against each. You win the tournament if you win two games in a row, and you want to maximize the probability of winning.
Show that it is optimal to play the weakest opponent second and that the order of playing the other two opponents does not matter.