In a computer game, a bug moves from left to right through a network of connected paths. The bug starts at \(\mathrm{S}\) and, at each junction, randomly takes the left fork with probability \(p\) or the right fork with probability \(q\), where \(q=1-p\). The forks taken at each junction are independent. The bug finishes its journey at one of the \(9\) endpoints labelled \(\mathrm{A}-\mathrm{I}\) (see diagram).
In another version of the game, the probability that, at each junction, the bug takes the left fork is \(0.9p\), the probability that the bug takes the right fork is \(0.9q\) and the probability that the bug is swallowed up by a ‘black hole’ is \(0.1\).



Need help? Join our JC Math tuition classes.
Learn more