We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...
Erik D. Demaine, Martin L. Demaine, Arthur Langerm...
Abstract—We address the parallelization of a MonteCarlo search algorithm. On a cluster of 64 cores we obtain a speedup of 56 for the parallelization of Morpion Solitaire. An algo...