Morpion Solitaire - Papers
All
of them are freely accessible through the Internet. By
chronological order of publication.
Until 2009
- Hugues Juillé, "Incremental Co-evolution
of Organisms: A New Approach for Optimization and Discovery of Strategies",
Proceedings of the Third European Conference on Artificial Life, Granada,
Spain, June 1995, Lecture Notes in Computer Sciences 929, pp. 246-260, http://demo.cs.brandeis.edu/papers/ecal95.pdf
- Hugues Juillé, "Methods for Statistical Inference:
Extending the Evolutionary Computation Paradigm", Doctoral Dissertation, Brandeis University, Department of Computer
Science, May 1999, http://www.demo.cs.brandeis.edu/papers/hugues_thesis.pdf
- Erik D.
Demaine, Martin L. Demaine, Arthur Langerman, and Stefan Langerman, "Morpion Solitaire",
- 2004 version, Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), Isola d'Elba, Italy, May
26–28, 2004, pp. 53–64, http://erikdemaine.org/papers/Morpion_FUN2004/paper.pdf
- 2006 version, Theory
of Computing Systems, volume 39, number 3, June 2006, pp. 439–453,
http://erikdemaine.org/papers/Morpion_TheoryComputSys/paper.pdf
- Bernard Helmstetter and Tristan Cazenave,
"Incremental Transpositions", Computers and Games: 4th International Conference
(CG 2004),
Ramat-Gan, Israel, July 5-7, 2004, Lecture Notes in Computer Sciences 3846, pp. 220-231, http://www.lamsade.dauphine.fr/~cazenave/papers/it.pdf
- Tristan Cazenave, "Reflexive Monte-Carlo Search", Proceedings
of Computers Games Workshop 2007 (CGW 2007), pp. 165-173, June 2007, http://www.lamsade.dauphine.fr/~cazenave/papers/reflexmc.pdf
- Heikki Hyyrö and Timo Poranen, "New Heuristics for Morpion Solitaire",
October 2007, http://www.cs.uta.fi/~tp/pub/morpion-article.pdf
- Tristan Cazenave and Nicolas Jouandeau,
"Parallel Nested Monte-Carlo
Search", 12th International Workshop on Nature Inspired Distributed
Computing (NIDISC 2009), Roma, Italy, May 2009, http://www.lamsade.dauphine.fr/~cazenave/papers/parallelNested.pdf
- Tristan Cazenave, "Nested Monte-Carlo
Search", International Joint Conferences on Artificial Intelligence
2009 (IJCAI 2009), Pasadena, USA, pp. 456-461, July 2009, http://ijcai.org/papers09/Papers/IJCAI09-083.pdf
Since
2010
- Haruhiko Akiyama and Yoshiyuki Kotani, "Nested
Monte-Carlo Search Improvement by Search Number Adjustment using AMAF",
IPSJ (Information Processing Society in Japan) SIG Technical Report,
Vol.2010-GI-23 No7, March 2010, http://id.nii.ac.jp/1001/00068067/
or http://www.tuat.ac.jp/~kotani/docs/GI23-7.pdf,
written in Japanese
- Stefan Edelkamp, Peter Kissmann, Damian
Sulewski, Hartmut Messerschmidt, "Finding the Needle in the Haystack
with Heuristically Guided Swarm Tree Search", MKWI 2010 (Multikonferenz
Wirtschaftsinformatik), Göttingen, February 2010, pp. 453-454, http://paperc.de/10985-multikonferenz-wirtschaftsinformatik-2010-9783941875319#!/pages/453
- Chris Rosin, "Nested Rollout Policy
Adaptation for Monte Carlo Tree Search", International Joint Conferences on Artificial Intelligence
2011 (IJCAI 2011), pages 649-654, Barcelona, Spain, July 2011, http://ijcai.org/papers11/Papers/IJCAI11-115.pdf (or
http://chrisrosin.com/rosin-ijcai11.pdf)
- Tristan Cazenave
and Fabien Teytaud,
- "Application of the Nested Rollout
Policy Adaptation Algorithm to the Traveling Salesman Problem with Time
Windows", Learning and Intelligent OptimizatioN Conference 2012
(LION 6), Paris, France, January 2012, Lecture Notes in Computer
Science 7219, http://www.lamsade.dauphine.fr/~cazenave/papers/tsptwnrpa.pdf
- "Beam Nested Rollout Policy Adaptation",
Computer Games Workshop, European Conference on Artificial Intelligence
2012 (ECAI 2012), Montpellier, France, August 2012, http://www.lamsade.dauphine.fr/~cazenave/papers/CazenaveBeam.pdf
- Tristan Cazenave, "Monte-Carlo Beam
Search", IEEE Transactions on Computational Intelligence and AI
in Games, Vol. 4 (1), pages 68-72, March 2012, http://www.lamsade.dauphine.fr/~cazenave/papers/beam.pdf
- Akitoshi Kawamura, Takuma Okamoto, Yuichi
Tatsu, Yushi Uno, and Masahide Yamato, "Morpion Solitaire 5D: a new
upper bound of 121 on the maximum score"
Other papers can be seen, directly in this
website:
- Pierre Berloquin, "Les records à battre du Morpion Solitaire", Science
& Vie, April 1974, pp. 144-145, from here
- Pierre Berloquin, "Les nouveaux records de
l'automorpion", Science
& Vie, November 1974, pp. 148-149, from here
- C. Croft, "Scaffold", Puzzle pages
compiled by David Wells, Games and Puzzles, n°40, September 1975,
p. 36, from here
- Pierre Berloquin, "Mini-morpion et nouveaux problèmes
de dominos", Science & Vie, April 1976, pp. 130-131, from
here
- Michel Brassinne, "Le morpion solitaire",
Jeux & Stratégie, August-September 1982, pp. 28-29, from
here
- Walter Joris, "Connector", 100
Strategic Games for Pen and Paper, Carlton Books, 2002, p. 105, from
here
- Achim
Flammenkamp, "Le Morpion Solitaire", March 2003, from here
- Vincent Everaert, "Morpiae", Tangente
Jeux & Stratégie, n°11, Nov.-Dec. 2004, p. 54, from
here
- Bernard Helmstetter, "Analyses de dépendances et méthodes
de Monte-Carlo dans les jeux de réflexion", PhD Thesis, Université
de Paris 8, February 2007, from here
- Pekka Karjalainen, "Bounding the Upper
Limit of Moves in the Game of Morpion Solitaire 5D",
August 2010, from here
- Christian Boyer, "Morpion Solitaire,
le record est enfin battu !", Science & Vie, November 2010,
pp. 144-147, from here
- Achim
Flammenkamp, "Le Morpion Solitaire", new version of November 2011, from here
© Christian Boyer, www.morpionsolitaire.com