Let's suppose we can toss a fair coin as many times as we want (i.e. a
coin that gives heads and tails both with probability equal to 1/2).
The first player chooses a triplet (e.g.
THH), afterwards the
second player chooses another triplet (e.g.
HTH). The coin is
tossed until one of the chosen triplets appears. The player whose
triplet appears first wins.
With the choices above, if the sequence of tosses is
HTTTHTTHH,
then the first player wins because the triplet
HTH did not show
up, while the triplet
THH appears in the last three
tosses. Instead, if the sequence of tosses is
HTTHTH, the
second player wins.
Keep in mind that when we start the game, we have no way of knowing
how many tosses will be needed to end the game.
I-1 A single game
I-2 You choose first
I-3 The computer chooses first
I-4 Let's work on the strategy