Intransitiveness: From Games to Random Walks
Many games in which chance plays a role can be simulated as a random walk over a graph of possible configurations of board pieces, cards, dice or coins. The end of the game generally consists of the appearance of a predefined winning pattern; for random walks, this corresponds to an absorbing trap....
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
MDPI AG
2020-09-01
|
| סדרה: | Future Internet |
| נושאים: | |
| גישה מקוונת: | https://www.mdpi.com/1999-5903/12/9/151 |