Move ordering and communities in complex networks describing the game of go

Vivek Kandiah (1) , Bertrand Georgeot (1, 2) , Olivier Giraud (3)

1 LPT - Laboratoire de Physique Théorique
2 ICQ - Cohérence Quantique (LPT)
3 LPTMS - Laboratoire de Physique Théorique et Modèles Statistiques

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.

Domaines: Mécanique statistique [cond-mat.stat-mech]; Physique et Société [physics.soc-ph]

Vivek Kandiah, Bertrand Georgeot, Olivier Giraud. Move ordering and communities in complex networks describing the game of go. The European Physical Journal B: Condensed Matter and Complex Systems, 2014, 87, pp.246. ⟨10.1140/epjb/e2014-50497-1⟩. ⟨hal-00996291⟩