Simon Viennot
Simon Robert Michel Viennot,
a French computer scientist, and assistant professor and researcher at Japan Advanced Institute of Science and Technology. He holds a M.Sc. in electrical engineering from École centrale de Nantes in 2004, and a Ph.D in CS from Lille University of Science and Technology in 2011. His research interests include combinatorial game theory and Monte-Carlo tree search.
Contents
Combinatorial Games Solver
Along with Julien Lemoine, Simon Viennot is author of Glop [2] [3] [4], an open source software to compute the winning strategies of combinatorial games, such as Sprouts, Cram and Dots and Boxes. In 2007, they introduced an algorithm based on the concept of nimbers to solve Sprouts with up to 32 spots in the normal version, extended to up to 44 spots in 2011, and three isolated starting positions, with 46, 47 and 53 spots. In 2009, they reached 17 spots in the more complicated misère version and were able to extend their analysis up to 20 points in 2011 [5] [6].
Kitsune & Flukz
Further, Lemoine and Viennot are authors of Kitsune [7], a software aiming at solving digit problem of a famous television game show [8], and co-authors of Flukz, an editor of shoot'em up video games [9].
Selected Publications
2008 ...
- Julien Lemoine, Simon Viennot (2008). Sprouts game on compact surfaces. General Topology
- Julien Lemoine, Simon Viennot (2009). Analysis of misere Sprouts game with reduced canonical trees. [11]
2010 ...
- Julien Lemoine, Simon Viennot (2010). Computer analysis of Sprouts with nimbers. To appear in Games of No Chance 4
- Julien Lemoine, Simon Viennot (2010). Nimbers are inevitable. Computer Science and Game Theory [12]
- Kokolo Ikeda, Daisuke Tomizawa, Simon Viennot, Yuu Tanaka (2012). Playing PuyoPuyo: Two search algorithms for constructing chain and tactical heuristics. CIG 2012 [13]
- Kokolo Ikeda, Simon Viennot, et al. (2012). Adaptation of game AIs using Genetic Algorithm: Keeping variety and suitable strength. ISIS 2012
- Kokolo Ikeda, Simon Viennot (2013). Production of various strategies and position control for Monte-Carlo Go - Entertaining human players. CIG 2013
- Simon Viennot, Kokolo Ikeda (2013). Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search. CG 2013
2015 ...
- Kokolo Ikeda, Takanari Shishido, Simon Viennot (2015). Machine-Learning of Shape Names for the Game of Go. Advances in Computer Games 14
- Francois Bonnet, Simon Viennot (2016). Nash Equilibrium in Mastermind. CG 2016
- Kokolo Ikeda, Simon Viennot, Naoyuki Sato (2016). Detection and labeling of bad moves for coaching go. CIG 2016
- Simon Viennot (2017). Toward Solving "EinStein würfelt nicht!". Advances in Computer Games 15
External Links
References
- ↑ Clipped from Prize giving ceremony Go 19x19, 18th Computer Olympiad, 2015, Siver for Nomitan
- ↑ SproutsWiki - Combinatorial games solver
- ↑ News about Glop by Julien Lemoine, Google Groups - Sprouts-Theory, December 17, 2010
- ↑ Glop 2.0 release by Julien Lemoine, Google Groups - Sprouts-Theory, February 28, 2011
- ↑ Sprouts (game) from Wikipedia
- ↑ SproutsWiki - Records
- ↑ Kitsune from Wikipedia
- ↑ KitsuneWiki
- ↑ Flukz
- ↑ dblp: Simon Viennot
- ↑ Misere article by Julien Lemoine, Google Groups - Sprouts-Theory, September 01, 2009
- ↑ MathPuzzle.com, December 23, 2010
- ↑ Puyo Puyo from Wikipedia