Skip to Main content Skip to Navigation
Conference papers

Random positions in Go

Abstract : 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).
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Fabien Teytaud Connect in order to contact the contributor
Submitted on : Thursday, September 22, 2011 - 4:56:32 PM
Last modification on : Sunday, June 26, 2022 - 11:54:27 AM
Long-term archiving on: : Friday, December 23, 2011 - 2:30:34 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads