About: Zero-player game is a research topic. Over the lifetime, 3 publications have been published within this topic receiving 4 citations. The topic is also known as: zero player game & no-player game.
TL;DR: The optimal bound for the maximum number of moves required to reach a periodic configuration of open mancala (also called open owari), inspired by a popular African game, is determined.
TL;DR: The main techniques employed are dynamic programming, the Sprague-Grundy game theory and pattern extraction, and elements from computational geometry, like orthogonal range searching data structures.
Abstract: In this paper we present efficient and intelligent strategies for several zero-, one- and two-player games. Most of the games have been studied before or are related to other well-known games, but we present improved algorithmic techniques for playing them optimally. The main techniques we employed are dynamic programming, the Sprague-Grundy game theory and pattern extraction. We also make use of elements from computational geometry, like orthogonal range searching data structures.
TL;DR: In this article, the authors investigate a simple discrete time random process based on the construction of Platonic solids and find some intriguing results, in this case requiring a careful consideration of how the probability distributions describing this process behave.
Abstract: We investigate a simple a discrete time random process based on the construction of Platonic solids. As is surprisingly often the case with apparently simple processes, we find some intriguing results, in this case requiring a careful consideration of how the probability distributions describing this process behave. The investigation proceeds by a fruitful combination of geometry, probability and elementary real analysis. We conclude with a consideration of the limiting behaviour of the probability distributions describing the size of the solid as the number of steps grows.