We recall a combinatorial derivation of the functions generating the probability of winning for each of many participants of the Penney game and show a generalization of the Conway formula for this case.
This paper describes, at elementary level, Penney‟s game using the example of two players and a symmetric coin. It also provides a generalization for an unlimited number of players and coins, as an example, not an intuitive aspect of the teaching probability theory.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.