Morpion Solitaire 5D: a new upper bound 121 on the maximum score

@article{Kawamura2013MorpionS5,
  title={Morpion Solitaire 5D: a new upper bound 121 on the maximum score},
  author={Akitoshi Kawamura and Yuichi Tatsu and Yushi Uno and Masahide Yamato},
  journal={Inf. Process. Lett.},
  year={2013},
  volume={121},
  pages={6-10}
}

Figures and Tables from this paper

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.
Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada
TLDR
This paper considers robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, nonchiral, and non-rigid, which implies that features such as synchronicity, chirality, and rigidity are computationally irrelevant.

References

SHOWING 1-10 OF 15 REFERENCES
Morpion Solitaire
TLDR
It is shown that the popular pencil-and-paper game called morpion solitaire is NP-hard and the high score is inapproximable within $n^{1-\epsilon}$ for any $\ep silon>0$ unless P = NP.
New Heuristics for Morpion Solitaire
TLDR
The experiments show that simulated annealing (SA) works quite well and fast and is used to find the best known results for non-trivial cases of the disjoint model of Morpion Solitaire.
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.
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 Rollout Policy Adaptation for Monte Carlo Tree Search
TLDR
A new MCTS method that dynamically adapts the rollout policy during search, in deterministic optimization problems, that can substantially improve search efficiency compared to NMCS and improve upon all previous published solutions for the test problems.
Bounding the upper limit of moves in the game of Morpion Solitaire 5D
  • http://www. morpionsolitaire.com/Karjalainen.pdf
  • 2011
Morpion Solitaire. Theory of Computing Systems
  • 2006
Mini-morpion et nouveauxprobì emes de dominos
  • Science and Vie
  • 1976
Mini-morpion et nouveaux problèmes de dominos. Science and Vie
  • 1976
Morpion Solitaire, le record est enfin battu
  • Science et Vie, pp
  • 2010
...
...