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).
['Bernard Helmstetter', 'Chang-Shing Lee', 'Fabien Teytaud', 'Olivier Teytaud', 'Mei-Hui Wang', 'Shi-Jim Yen']
Random positions in Go