Reflexive Monte-Carlo Search
Tristan Cazenave · 2007
Abstract. Reflexive Monte-Carlo search uses the Monte-Carlo search of a givenlevel to improve the search of the upper level. We describe the application to Morpion Solitaire. For the non touching version, reflexive Monte-Carlo searchbreaks the current record and establishes a new record of 78 moves. 1 Introduction Monte-Carlo methods have been applied with success to many games. In perfect infor-mation games, they are quite successful for the game of Go which has a huge search space [1]. The UCT algorithm [9] in combination to the incremental development ofa global search tree has enabled Go programs such as C RAZY STONE [2] and MOGO[11] to be the best on 9 * 9 boards and to become competitive on 19 * 19 boards.