Considering the question of the 26-losses-and-a-draw sequence suffered by Stephen Crockett, whose curious playing record we have been looking at this past week, it occurred to me that we have a precedent in a story many chess players learn soon after they learn the moves. It's described on Wikipedia as the "wheat and chessboard" problem. I'm sure most readers know how it goes.
Sometimes it ends well, sometimes it doesn't.
Now in our current example, nobody is calling for anybody's execution, while controller of the Grand Prix isn't quite "a high-ranking advisor", but let us perform our own version of the problem, just to get ourselves a starting-point figure to work with.
It is, as I say, a starting-point figure, no more than that, so to obtain it, I've taken it that we wish to calculate the probability of a random player1 obtaining such a score in a twenty-seven game sequence2 against evenly-matched opponents.3 I've neglected the question of colours and I've chosen to estimate the probability of each result as follows:
Win 40% Draw 20% Loss 40%.
Obviously the reader is welcome to employ different values and thereby obtain a different result.
A different result, that is, from 1.37 billion to one.