| dc.contributor.author | Kapela, Tomasz | pl_PL |
| dc.date.accessioned | 2019-09-11T09:10:29Z | |
| dc.date.available | 2019-09-11T09:10:29Z | |
| dc.date.issued | 2002 | |
| dc.identifier.citation | Annales Academiae Paedagogicae Cracoviensis. 5, Studia Ad Calculum Probabilitatis Eiusque Didacticam Pertinentia 1 (2001), s. [29]-38 | pl_PL |
| dc.identifier.uri | http://hdl.handle.net/11716/5799 | |
| dc.description.abstract | At first, Penney’s game and hazard Penney’s game was defined (some kind of games played with a coin). This
article, in great part, is about hazard Penney’s game. It shows how Engel’s graphs can be used to calculate
expected value of each player’s prize. This algorithm and other algorithms concerning Engel’s graphs were written
in the matrix form. The last paragraph includes a few examples of hazard Penney’s games which have interesting
properties and which are many times in contradiction with our intuition. | en_EN |
| dc.language.iso | pl | pl_PL |
| dc.title | Hazardowa wersja gry Penney'a | pl_PL |
| dc.type | Article | pl_PL |
