Bernard Helmstetter, a French computer scientist, game researcher and programmer at Paris 8 University, a 5 Dan Go player [1], and along with Bruno Bouzy and Tristan Cazenave one of the pioneers in Monte-Carlo Tree Search [2] and its application in Computer Go [3]. Bernard Helmstetter is author of the Lines of Action program BING (Bing Is Not Gnuchess), which re-utilize large parts of code from GNU Chess, and the Go program Oleg.
Bernard Helmstetter [4]

Selected Publications

• Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. Advances in Computer Games 10, pdf
• Bernard Helmstetter, Tristan Cazenave (2003). Searching with analysis of dependencies in a solitaire card game. Advances in Computer Games 10, pdf
• Bernard Helmstetter, Tristan Cazenave (2004). Incremental Transpositions. CG 2004, pdf
• Tristan Cazenave, Bernard Helmstetter (2005). Combining tactical search and Monte-Carlo in the game of Go. IEEE CIG 2005, pdf
• Tristan Cazenave, Bernard Helmstetter (2005). Search for transitive connections. Information Sciences, Vol. 175 No. 4, pdf

External Links

• Helmstetter Bernard
• Bernard Helmstetter's ICGA Tournaments
• Sensei's Library: Bernard Helmstetter

References

1. ^ Sensei's Library: Bernard Helmstetter
2. ^ Rémi Coulom (2007). Monte-Carlo Tree Search in Crazy Stone. slides as pdf
3. ^ Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. Advances in Computer Games 10, pdf
4. ^ Helmstetter Bernard
5. ^ DBLP: Bernard Helmstetter

What links here?