Advertisement

Theory of Computing Systems

, Volume 39, Issue 3, pp 439–453 | Cite as

Morpion Solitaire

  • Erik D. Demaine
  • Martin L. Demaine
  • Arthur Langerman
  • Stefan Langerman
Article

Abstract

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.

Keywords

Line Segment Greedy Algorithm Nonnegativity Constraint Output Wire Input Wire 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA 02139USA
  2. 2.Langerman Diamonds, 62 Pelikaanstraat, 2018 AntwerpenBelgium
  3. 3.Departement d'informatique, Universite Libre de Bruxelles, B-1050 BrussellsBelgium

Personalised recommendations