Sequencing Chess
arXiv:1609.04648 · doi:10.1209/0295-5075/116/10009
Abstract
We analyze the structure of the state space of chess by means of transition path sampling Monte Carlo simulation. Based on the typical number of moves required to transpose a given configuration of chess pieces into another, we conclude that the state space consists of several pockets between which transitions are rare. Skilled players explore an even smaller subset of positions that populate some of these pockets only very sparsely. These results suggest that the usual measures to estimate both, the size of the state space and the size of the tree of legal moves, are not unique indicators of the complexity of the game, but that topological considerations are equally important.
References in corpus (5)
- Random graphs with arbitrary degree distributions and their applications
- A General Algorithm for Sampling Rare Events in Non-Equilibrium and Non-Stationary Systems
- Zipf law in the popularity distribution of chess openings
- Memory and long-range correlations in chess games
- Optimal Dimensionality Reduction of Complex Dynamics: The Chess Game as Diffusion on a Free Energy Landscape