25,161
edits
Changes
Created page with "'''Home * People * Simon Viennot''' FILE:SimonViennot.jpg|border|right|thumb|link=https://icga.org/?page_id=1467|Simon Viennot <ref>Clipped from [https://..."
'''[[Main Page|Home]] * [[People]] * Simon Viennot'''
[[FILE:SimonViennot.jpg|border|right|thumb|link=https://icga.org/?page_id=1467|Simon Viennot <ref>Clipped from [https://icga.org/?page_id=1467 Prize giving ceremony Go 19x19], [[18th Computer Olympiad#Go|18th Computer Olympiad, 2015]], Siver for [https://www.game-ai-forum.org/icga-tournaments/program.php?id=625 Nomitan]</ref> ]]
'''Simon Robert Michel Viennot''',<br/>
a French computer scientist, and assistant professor and researcher at [[JAIST|Japan Advanced Institute of Science and Technology]]. He holds a M.Sc. in electrical engineering from [https://en.wikipedia.org/wiki/%C3%89cole_centrale_de_Nantes École centrale de Nantes] in 2004, and a Ph.D in CS from [https://en.wikipedia.org/wiki/Lille_University_of_Science_and_Technology Lille University of Science and Technology] in 2011. His research interests include [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory] and [[Monte-Carlo Tree Search|Monte-Carlo tree search]].
=Combinatorial Games Solver=
Along with [[Julien Lemoine]], Simon Viennot is author of '''Glop''' <ref>[http://sprouts.tuxfamily.org/wiki/doku.php SproutsWiki - Combinatorial games solver]</ref> <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/cu5t7NBSXqY News about Glop] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], December 17, 2010</ref> <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/mS3qbTpMBUM Glop 2.0 release] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], February 28, 2011</ref>, an open source software to compute the winning strategies of combinatorial games, such as [https://en.wikipedia.org/wiki/Sprouts_%28game%29 Sprouts], [https://en.wikipedia.org/wiki/Cram_%28game%29 Cram] and [https://en.wikipedia.org/wiki/Dots_and_Boxes Dots and Boxes]. In 2007, they introduced an algorithm based on the concept of [https://en.wikipedia.org/wiki/Nimber 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 [https://en.wikipedia.org/wiki/Sprouts_%28game%29#Mis.C3.A8re_version misère version] and were able to extend their analysis up to 20 points in 2011 <ref>[https://en.wikipedia.org/wiki/Sprouts_%28game%29 Sprouts (game) from Wikipedia]</ref> <ref>[http://sprouts.tuxfamily.org/wiki/doku.php?id=records SproutsWiki - Records]</ref>.
=Kitsune & Flukz=
Further, Lemoine and Viennot are authors of '''Kitsune''' <ref>[https://en.wikipedia.org/wiki/Kitsune Kitsune from Wikipedia]</ref>, a software aiming at solving digit problem of a famous [http://simple.wikipedia.org/wiki/Countdown_%28game_show%29 television game show] <ref>[http://kitsune.tuxfamily.org/wiki/doku.php?id=homepage KitsuneWiki]</ref>, and co-authors of '''Flukz''', an editor of [https://en.wikipedia.org/wiki/Shoot_%27em_up shoot'em up] [https://en.wikipedia.org/wiki/Video_game video games] <ref>[http://flukz.org/wiki/doku.php?id=flukz Flukz]</ref>.
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/v/Viennot:Simon dblp: Simon Viennot]</ref>
==2008 ...==
* [[Julien Lemoine]], [[Simon Viennot]] ('''2008'''). ''[http://arxiv.org/abs/0812.0081 Sprouts game on compact surfaces]''. General Topology
* [[Julien Lemoine]], [[Simon Viennot]] ('''2009'''). ''[http://arxiv.org/abs/0908.4407 Analysis of misere Sprouts game with reduced canonical trees]''. <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/V-4HIQYyuEg Misere article] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], September 01, 2009</ref>
==2010 ...==
* [[Julien Lemoine]], [[Simon Viennot]] ('''2010'''). ''[http://arxiv.org/abs/1008.2320 Computer analysis of Sprouts with nimbers]''. To appear in [[Richard J. Nowakowski|Games of No Chance 4]]
* [[Julien Lemoine]], [[Simon Viennot]] ('''2010'''). ''[http://arxiv.org/abs/1011.5841 Nimbers are inevitable]''. Computer Science and Game Theory <ref>[http://www.mathpuzzle.com/23Dec2010.html MathPuzzle.com], December 23, 2010</ref>
* [[Kokolo Ikeda]], [http://www.informatik.uni-trier.de/~ley/pers/hd/t/Tomizawa:Daisuke Daisuke Tomizawa], [[Simon Viennot]], [http://www.informatik.uni-trier.de/~ley/pers/hd/t/Tanaka:Yuu.html Yuu Tanaka] ('''2012'''). ''Playing PuyoPuyo: Two search algorithms for constructing chain and tactical heuristics''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2012.html#IkedaTVT12 CIG 2012] <ref>[https://en.wikipedia.org/wiki/Puyo_Puyo Puyo Puyo from Wikipedia]</ref>
* [[Kokolo Ikeda]], [[Simon Viennot]], et al. ('''2012'''). ''Adaptation of game AIs using Genetic Algorithm: Keeping variety and suitable strength''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6495582 ISIS 2012]
* [[Kokolo Ikeda]], [[Simon Viennot]] ('''2013'''). ''Production of various strategies and position control for Monte-Carlo Go - Entertaining human players''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2013.html#IkedaV13 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]]
* [[Simon Viennot]] ('''2017'''). ''Toward Solving "EinStein würfelt nicht!"''. [[Advances in Computer Games 15]]
=External Links=
* [http://sprouts.tuxfamily.org/wiki/doku.php SproutsWiki - Combinatorial games solver]
: [http://sprouts.tuxfamily.org/wiki/doku.php?id=records SproutsWiki - Records]
* [http://kitsune.tuxfamily.org/wiki/doku.php?id=homepage KitsuneWiki]
* [http://flukz.org/wiki/doku.php?id=flukz Flukz]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:SimonViennot.jpg|border|right|thumb|link=https://icga.org/?page_id=1467|Simon Viennot <ref>Clipped from [https://icga.org/?page_id=1467 Prize giving ceremony Go 19x19], [[18th Computer Olympiad#Go|18th Computer Olympiad, 2015]], Siver for [https://www.game-ai-forum.org/icga-tournaments/program.php?id=625 Nomitan]</ref> ]]
'''Simon Robert Michel Viennot''',<br/>
a French computer scientist, and assistant professor and researcher at [[JAIST|Japan Advanced Institute of Science and Technology]]. He holds a M.Sc. in electrical engineering from [https://en.wikipedia.org/wiki/%C3%89cole_centrale_de_Nantes École centrale de Nantes] in 2004, and a Ph.D in CS from [https://en.wikipedia.org/wiki/Lille_University_of_Science_and_Technology Lille University of Science and Technology] in 2011. His research interests include [https://en.wikipedia.org/wiki/Combinatorial_game_theory combinatorial game theory] and [[Monte-Carlo Tree Search|Monte-Carlo tree search]].
=Combinatorial Games Solver=
Along with [[Julien Lemoine]], Simon Viennot is author of '''Glop''' <ref>[http://sprouts.tuxfamily.org/wiki/doku.php SproutsWiki - Combinatorial games solver]</ref> <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/cu5t7NBSXqY News about Glop] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], December 17, 2010</ref> <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/mS3qbTpMBUM Glop 2.0 release] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], February 28, 2011</ref>, an open source software to compute the winning strategies of combinatorial games, such as [https://en.wikipedia.org/wiki/Sprouts_%28game%29 Sprouts], [https://en.wikipedia.org/wiki/Cram_%28game%29 Cram] and [https://en.wikipedia.org/wiki/Dots_and_Boxes Dots and Boxes]. In 2007, they introduced an algorithm based on the concept of [https://en.wikipedia.org/wiki/Nimber 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 [https://en.wikipedia.org/wiki/Sprouts_%28game%29#Mis.C3.A8re_version misère version] and were able to extend their analysis up to 20 points in 2011 <ref>[https://en.wikipedia.org/wiki/Sprouts_%28game%29 Sprouts (game) from Wikipedia]</ref> <ref>[http://sprouts.tuxfamily.org/wiki/doku.php?id=records SproutsWiki - Records]</ref>.
=Kitsune & Flukz=
Further, Lemoine and Viennot are authors of '''Kitsune''' <ref>[https://en.wikipedia.org/wiki/Kitsune Kitsune from Wikipedia]</ref>, a software aiming at solving digit problem of a famous [http://simple.wikipedia.org/wiki/Countdown_%28game_show%29 television game show] <ref>[http://kitsune.tuxfamily.org/wiki/doku.php?id=homepage KitsuneWiki]</ref>, and co-authors of '''Flukz''', an editor of [https://en.wikipedia.org/wiki/Shoot_%27em_up shoot'em up] [https://en.wikipedia.org/wiki/Video_game video games] <ref>[http://flukz.org/wiki/doku.php?id=flukz Flukz]</ref>.
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/v/Viennot:Simon dblp: Simon Viennot]</ref>
==2008 ...==
* [[Julien Lemoine]], [[Simon Viennot]] ('''2008'''). ''[http://arxiv.org/abs/0812.0081 Sprouts game on compact surfaces]''. General Topology
* [[Julien Lemoine]], [[Simon Viennot]] ('''2009'''). ''[http://arxiv.org/abs/0908.4407 Analysis of misere Sprouts game with reduced canonical trees]''. <ref>[https://groups.google.com/forum/#!topic/sprouts-theory/V-4HIQYyuEg Misere article] by [[Julien Lemoine]], [https://groups.google.com/forum/#!forum/sprouts-theory Google Groups - Sprouts-Theory], September 01, 2009</ref>
==2010 ...==
* [[Julien Lemoine]], [[Simon Viennot]] ('''2010'''). ''[http://arxiv.org/abs/1008.2320 Computer analysis of Sprouts with nimbers]''. To appear in [[Richard J. Nowakowski|Games of No Chance 4]]
* [[Julien Lemoine]], [[Simon Viennot]] ('''2010'''). ''[http://arxiv.org/abs/1011.5841 Nimbers are inevitable]''. Computer Science and Game Theory <ref>[http://www.mathpuzzle.com/23Dec2010.html MathPuzzle.com], December 23, 2010</ref>
* [[Kokolo Ikeda]], [http://www.informatik.uni-trier.de/~ley/pers/hd/t/Tomizawa:Daisuke Daisuke Tomizawa], [[Simon Viennot]], [http://www.informatik.uni-trier.de/~ley/pers/hd/t/Tanaka:Yuu.html Yuu Tanaka] ('''2012'''). ''Playing PuyoPuyo: Two search algorithms for constructing chain and tactical heuristics''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2012.html#IkedaTVT12 CIG 2012] <ref>[https://en.wikipedia.org/wiki/Puyo_Puyo Puyo Puyo from Wikipedia]</ref>
* [[Kokolo Ikeda]], [[Simon Viennot]], et al. ('''2012'''). ''Adaptation of game AIs using Genetic Algorithm: Keeping variety and suitable strength''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6495582 ISIS 2012]
* [[Kokolo Ikeda]], [[Simon Viennot]] ('''2013'''). ''Production of various strategies and position control for Monte-Carlo Go - Entertaining human players''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2013.html#IkedaV13 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]]
* [[Simon Viennot]] ('''2017'''). ''Toward Solving "EinStein würfelt nicht!"''. [[Advances in Computer Games 15]]
=External Links=
* [http://sprouts.tuxfamily.org/wiki/doku.php SproutsWiki - Combinatorial games solver]
: [http://sprouts.tuxfamily.org/wiki/doku.php?id=records SproutsWiki - Records]
* [http://kitsune.tuxfamily.org/wiki/doku.php?id=homepage KitsuneWiki]
* [http://flukz.org/wiki/doku.php?id=flukz Flukz]
=References=
<references />
'''[[People|Up one level]]'''
