*Difficulty:*★★★☆☆ undergraduate

We continue with the bridge-crossing scenario from *Squid Game* called “Glass Stepping Stones”. Here I analyse the probabilities for late contestants on a very long bridge, and the expectation value for a player’s progress. Last time I found an exact expression for the probability *P*(*i*,*n*) that player number *i* is still alive on the *n*th step. Now seems a good place to mention there are equivalent expressions, such as:

where is called the hypergeometric function, and the other term is the binomial coefficient which is read as “*n* choose *i*”. The factor seen previously has been absorbed. We listed several special cases of the probabilities last time. Another is:

So remarkably, the chance player *i* will be alive on step 2*i* – 1 is precisely 50%! For fixed large *i*, if we plot the probability distribution as a function of *n* it looks smooth, remaining near 1 for early steps before rolling down to near 0. Qualitatively this looks like a , tanh, or erf (“error function”). We reflect these curves, centre them on the value 1/2 at *n* = 2*i* – 1, and scale them linearly: so they have the appropriate bounds and match the slope at the centre point. See the Figure below.

In fact the slope used in the Figure is only an approximation as described next, but this is a deliberate choice to show it still gives a good fit. The exact slope evaluated at *n* = 2*i* – 1 seems a little too complicated to be useful. It contains a derivative of the hypergeometric function, which appears to approach -1/2 in the limit of large *i*, hence the slope at the centre point is asymptotic to . Another approach is to consider the subsequent bridge step, for which:

which uses the Gamma function. The difference *P*(*i*,2*i*) – *P*(*i*,2*i*-1) approximates the slope, and is also asymptotic to as . Hence our approximation for late players is:

Now the error function by definition is the integral of a gaussian curve. The derivative with respect to *n* of our approximation is precisely the righthand side below, which itself approximates the chance a late player dies on that step:

For fixed *i* this is a gaussian distribution with centre *n* = 2*i* – 1 and standard deviation . It is normalised in the sense its integral over is exactly 1, but physically we want the discrete sum over . For the 10th player this is approx. 0.9991, which is already close. The exact chance for dying on a given step was determined in the previous article to be . The Figure below shows some early values. As before, we can extend the function beyond integer parameters.

The ratio precisely. Hence for a given player, the adjacent steps *n* = 2*i* – 2 and 2*i* – 1 are equally likely locations their game will be “discontinued”. This is surely the maximum assuming integer parameters, apart from the first player for whom step 0 is safe but step 1 is their most likely “resting place”. Hence the reader might prefer to translate our gaussian approximation by half a step or so; apparently there are various approximations to a binomial coefficient. The subsequent step *n* = 2*i* is a more likely endpoint than the earlier step 2*i* – 3.

The *expectation value* for a given player’s death is:

This function is very close to 2*i*, apart from a small oscillatory wiggle. At integer *i* it is singular, but from inspection of its plot it may be extended to a continuous function with value precisely 2*i* on physical parameter values (that is, integer *i*). Finally, for a given step *n*, the probability that *some* player breaks a tile is:

precisely, which is unsurprising. (Better terminology would be the *n*th “column”, as Henle+ use.) This assumes that *n* or more players have finished their run, otherwise the step is less likely to be broken.

*Update*, May 19: The death chance is ½ times a binomial distribution in *n*. We previously found a gaussian curve for a given player *i*. Now. for a fixed step *n*, the de Moivre-Laplace approximation is a gaussian over the player number *i*:

**Squid Game bridge**| conditional probabilities 🠦

Trust your dollar to the Robot and see how it grows to $100. https://Findy.battletech-newsletter.de/gotodate/promo

Your money work even when you sleep. https://Findy.battletech-newsletter.de/gotodate/promo

Online earnings are the easiest way for financial independence. https://Findy.battletech-newsletter.de/gotodate/promo

Automatic robot is the best start for financial independence. https://Findy.battletech-newsletter.de/gotodate/promo