Morpion Solitaire

@article{Demaine2005MorpionS,
  title={Morpion Solitaire},
  author={Erik D. Demaine and Martin L. Demaine and Arthur Langerman and Stefan Langerman},
  journal={Theory of Computing Systems},
  year={2005},
  volume={39},
  pages={439-453}
}
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 that, in its most general form, the game is NP-hard and the high score is inapproximable within $n^{1-\epsilon}$ for any $\epsilon>0$ unless P = NP. 
Morpion Solitaire 5D: a new upper bound 121 on the maximum score
Tackling Morpion Solitaire with AlphaZero-like Ranked Reward Reinforcement Learning
TLDR
The recent impressive performance of deep self-learning reinforcement learning approaches from AlphaGo/AlphaZero is taken as inspiration to design a searcher for Morpion Solitaire, which is very close to the human best without any other adaptation to the problem than using ranked reward.
Games, puzzles and computation
TLDR
This thesis develops the idea of game as computation to a greater degree than has been done previously, and presents a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games.
Nested Monte-Carlo Search
TLDR
Nested Monte-Carlo Search addresses the problem of guiding the search toward better states when there is no available heuristic, and uses nested levels of random games to guide the search.
Nested Monte-Carlo Search with AMAF Heuristic
TLDR
In the present study, All-Move-As-First heuristic is incorporated in Nested Monte-Carlo Search and the number of search is reduced to maintain a pseudo number of searches in order to achieve the higher level search.
Monte Carlo Beam Search
  • T. Cazenave
  • Computer Science
    IEEE Transactions on Computational Intelligence and AI in Games
  • 2012
TLDR
The proposed Monte Carlo beam search achieves better scores in less time than NMC search alone and is able to match the record score of 82 moves on Morpion Solitaire.
Monte Carlo Search Algorithm Discovery for Single-Player Games
TLDR
This work proposes an MCS algorithm discovery scheme that introduces a grammar over MCS algorithms that enables inducing a rich space of candidate algorithms and relies on multiarmed bandits to approximately solve this optimization problem.
Monte Carlo Search Algorithm Discovery for One Player Games
TLDR
This work proposes an MCS algorithm discovery scheme that introduces a grammar over MCS algorithms that enables inducing a rich space of candidate algorithms and relies on multi-armed bandits to approximately solve this optimization problem.
Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search
TLDR
This paper considers the search in large state spaces with high branching factors and an objective function to be maximized and shows that UCT, which trades exploration for exploitation, can be more successful on several runs than on only one.
...
...

References

SHOWING 1-10 OF 10 REFERENCES
Erds Distance Problems in Normed Spaces
Incremental Co-Evolution of Organisms: A New Approach for Optimization and Discovery of Strategies
TLDR
The Evolving Non-Determinism (END) model presented in this paper proposes an inventive way to explore the space of states that, using the simulated “incremental” co-evolution of some organisms, remedies some drawbacks of these previous techniques and even allow this model to outperform them on some difficult problems.
Morpion solitaire
  • Morpion solitaire
Geometrisches zur zahlentheorie
  • Sitzungsberichte des Vereines 'Lotos'
  • 1899
Le morpion solitaire
  • Jeux & Stratégie
  • 1982
Le morpion solitaire
  • Manuscript, March
  • 2003
Jeux & Stratégie
  • Jeux & Stratégie
  • 1982
Enigma of malta cross game
  • Enigma of malta cross game
Morpion solitaire. http://euler.free.fr/morpion.htm
  • Received in final form July
  • 2005
All Squared Up: Tic-Tac-Toe for Geniuses (100 Strategic Games for Pen and Paper)
  • All Squared Up: Tic-Tac-Toe for Geniuses (100 Strategic Games for Pen and Paper)
  • 2002