Random positions in Go - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Random positions in Go


It is known that in chess, random positions are harder to memorize for humans. We here reproduce these experiments in the Asian game of Go, in which computers are much weaker than humans. We survey families of positions, discussing the relative strength of humans and computers, and then experiment random positions. The result is that computers are at the best amateur level for random positions. We also provide a protocol for generating interesting random positions (avoiding unfair situations).
Fichier principal
Vignette du fichier
randomgo.pdf (986.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00625815 , version 1 (22-09-2011)


  • HAL Id : inria-00625815 , version 1


Benard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Wang Mei-Hui, et al.. Random positions in Go. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. ⟨inria-00625815⟩
320 View
166 Download


Gmail Facebook Twitter LinkedIn More