Matthieu+Walraet

a French Go player 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. He has contributed to various open source projects, such as Luc Vannier's //OpenGotha// Go tournament management program, and the [|WireWorld] [|cellular automaton]. || toc =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 of
 * Home * People * Matthieu Walraet**
 * [[image:MatthieuWalraet.jpg link="https://github.com/MatthieuW"]] ||~ || **Matthieu Walraet**,
 * Matthieu Walraet ||~ ||^ ||

> math \displaystyle 10^{10^{48}} < N(19) < 10^{10^{171}} math

using properties of binary [|Gray code], Matthieu Walraet narrowed the huge gap to a lower bound of

> math \displaystyle 10^{10^{108}} math

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.

=Selected Publications=
 * Matthieu Walraet (**2016**). //A googolplex of Go games//. [|pdf]
 * John Tromp, Matthieu Walraet (**2016**). //A googolplex of Go games//. CG 2016

=External Links=
 * [|Matthieu Walraet]
 * [|Matthieu Walraet at Sensei's Library]
 * [|MatthieuW (Matthieu Walraet) · GitHub]
 * [|Matthieu Walraet (@MatthieuWalraet) | Twitter]
 * [|Matthieu Walraet - YouTube]
 * [|Matthieu Walraet | LinkedIn]

=References= =What links here?= include page="Matthieu Walraet" component="backlinks" limit="40"
 * Up one level**