In A googolplex of Go games in 2016, Matthieu Walraet elaborated on the number of possible Go games on a 19x19 board. Inspired by the work of John Tromp on the number of legal Go positions and John Tromp and Gunnar Farnebäck on the number of possible Go games on a board less than 19x19, who already established lower and upper bounds of
using properties of binary Gray code, Matthieu Walraet narrowed the huge gap to a lower bound of
well above a googolplex by subdividing the board and iterating over all legal sub-board positions. A revised version of his paper was presented along with John Tromp at the CG 2016 conference [6].
a French Go player [1] and software engineer with a masters degree in computer science from École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise in 1996 [2]. He has contributed to various open source projects, such as Luc Vannier's OpenGotha Go tournament management program [3], and the WireWorld cellular automaton [4].
Table of Contents
A googolplex of Go games
In A googolplex of Go games in 2016, Matthieu Walraet elaborated on the number of possible Go games on a 19x19 board. Inspired by the work of John Tromp on the number of legal Go positions and John Tromp and Gunnar Farnebäck on the number of possible Go games on a board less than 19x19, who already established lower and upper bounds ofusing properties of binary Gray code, Matthieu Walraet narrowed the huge gap to a lower bound of
well above a googolplex by subdividing the board and iterating over all legal sub-board positions. A revised version of his paper was presented along with John Tromp at the CG 2016 conference [6].
Selected Publications
External Links
References
What links here?
Up one level