Move ordering and communities in complex networks describing the game of go
arXiv:1405.6077 · doi:10.1140/epjb/e2014-50497-1
Abstract
We analyze the game of go from the point of view of complex networks. We construct three different directed networks of increasing complexity, defining nodes as local patterns on plaquettes of increasing sizes, and links as actual successions of these patterns in databases of real games. We discuss the peculiarities of these networks compared to other types of networks. We explore the ranking vectors and community structure of the networks and show that this approach enables to extract groups of moves with common strategic properties. We also investigate different networks built from games with players of different levels or from different phases of the game. We discuss how the study of the community structure of these networks may help to improve the computer simulations of the game. More generally, we believe such studies may help to improve the understanding of human decision process.
arXiv comment14 pages, 21 figures
References in corpus (11)
- Statistical mechanics of complex networks
- Community detection in graphs
- Spectral redemption: clustering sparse networks
- Network properties of written human language
- Ranking and clustering of nodes in networks with smart teleportation
- Two-dimensional ranking of Wikipedia articles
- Zipf law in the popularity distribution of chess openings
- Spectral properties of the Google matrix of the World Wide Web and other directed networks
- Delocalization transition for the Google matrix
- Spectral properties of Google matrix of Wikipedia and other networks
- The game of go as a complex network