Difference between revisions of "Bernard Helmstetter"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 26: | Line 26: | ||
[[Category:Go Player|Helmstetter]] | [[Category:Go Player|Helmstetter]] | ||
[[Category:Go Programmer|Helmstetter]] | [[Category:Go Programmer|Helmstetter]] | ||
| + | [[Category:Lines of Action Programmer|Helmstetter]] | ||
[[Category:Researcher|Helmstetter]] | [[Category:Researcher|Helmstetter]] | ||
Latest revision as of 19:15, 13 March 2019
Home * People * Bernard Helmstetter
Bernard Helmstetter [1]
Bernard Helmstetter,
a French computer scientist, game researcher and programmer at Paris 8 University, a 5 Dan Go player [2], and along with Bruno Bouzy and Tristan Cazenave one of the pioneers in Monte-Carlo Tree Search [3] and its application in Computer Go [4]. 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.
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
References
- ↑ Helmstetter Bernard
- ↑ Sensei's Library: Bernard Helmstetter
- ↑ Rémi Coulom (2007). Monte-Carlo Tree Search in Crazy Stone. slides as pdf
- ↑ Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. Advances in Computer Games 10, pdf
- ↑ DBLP: Bernard Helmstetter
