About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
February 2024 - Solution
February 2024 Solution:
This problem turned out to be more challanging than expected, due both for the (non intentional) tricky phrasing and the nontrivial mathematical structure involved.
Some of you interpreted " consecutive wins" of Alice to be "a sequence of at least
rounds in which
are Alice
wins and the rest are draws". This was not the intention - a draw certainly interrupts a sequence of wins.
Others correctly calculated Alice's chance to win a round (0.24826171875, can be found by straightforward enumeration
of all cases) and raised it to the power of N; this is wrong, since it answers the different question "If Alice and Bob play
exactly rounds, what is the chance of Alice winning all of them?" whereas the real question is "given that Alice and
Bob play indefintely, what is the chance that at one point of the game Alice will have
consecutive wins?"
The natural way to solve such a question is by using Markov chains. In this formulation, we consider all the states
the game can reach; here the states are of the form "Alice has consecutive wins" and "Bob has
consecutive
wins". This can be modeled using a single integer
(e.g.
means "Bob has 2 consecutive wins"). We have a
simple transition matrix, with each row having at most three nonzero entries corresponding to Alice win, Bob win and
draw.
We are interested in the hitting probability for the state representing Alice's win; a standard result in the
theory of Markov chains is that the hitting probability vector
for a set
of states is the minimal nonnegative
solution to the system of linear equations
Solving this system yields the winning probability for Alice (where is Alice's probability for winning a round and
is Bob's)
Plugging
yields
and plugging
yields