Join five
![](http://upload.wikimedia.org/wikipedia/commons/thumb/c/cc/Join_five_1.png/220px-Join_five_1.png)
![](http://upload.wikimedia.org/wikipedia/commons/thumb/9/9c/Join_five_2.png/220px-Join_five_2.png)
![](http://upload.wikimedia.org/wikipedia/commons/thumb/9/9c/Join_five_3.png/220px-Join_five_3.png)
![](http://upload.wikimedia.org/wikipedia/commons/thumb/5/5c/Join_five_4.png/220px-Join_five_4.png)
Join Five (also known as Morpion solitaire, Cross 'n' Lines or Line Game) is a paper and pencil game for one or two players, played on a plus-shaped grid of dots. The origins of the game are probably in northern Europe. References to the game first appeared in French publications in the 1970s.[1] In addition to being played recreationally, the game has been the subject of theoretical studies[2] and computer searches for solutions.[3]
How to play
An initial grid of dots are drawn; a square of 4x4 dots, with a rectangle of 4x3 added to each side. The initial cross is outlined in some versions of the game.
During each turn, draw a straight line that is exactly five "dots" long, such that:
- No part of the new line can retrace any portion of a previously drawn line. In the outlined version, the line can continue an existing line (they must not overlap).
- Exactly one of the five dots covered by the new line is missing from the grid before the line is drawn. This missing dot (which can be at either end of the new line, or somewhere in the middle) is also drawn during the turn.
- In the only outlined version, if no new dot is needed when drawing the line, the dot may be saved and can be used in later turns.
In other words, make a five-segment line from four dots, and draw in the fifth (unless it is saved to draw two dots in later turns).
Scoring
The game ends when no more segments can be drawn on the grid.
In the two player version, the last player to draw a line segment is the winner. In the single player version, scoring is accomplished by counting the number of segments drawn, or by calculating the total area of the grid at the end of play.
In the outlined version, the number of accomplished turns is the score. This is usually kept in check by using tally marks. It is unknown if this can be continued indefinitely, but the game becomes progressively more difficult (up to a point?) once the initial grid has been used completely.
Strategy
Strategy differs according to whether the game is played alone or against an opponent. In the first case, moves are optimized for the maximum number of possible turns; in the second case, the goal is to be "inefficient" with move selection to restrict the opponent's available moves.
Variations
The rules may be varied by requiring lines of 4 marked points in a row rather than 5, with a reduced starting configuration. Also, the "disjoint" variation of the game does not allow two parallel lines to share an endpoint, whereas the standard "touching" version does allow this.[4]
Records and computer searches
For the "touching" version of the game with lines consisting of 5 marked points, the present record of 178 lines was established on 2011 August 12, using a Monte-Carlo search by algorithmist Christopher Rosin.[5][6] This is eight moves more than the previous 1976 record of 170 lines.[3][5][7] The 1976 record was done by hand, and computer searches had not been able to approach this record[7] despite substantial progress,[8] until August 2010 when Christopher Rosin used a Monte-Carlo search to obtain a result of 172 moves, exceeding the 1976 record, and 178 moves one year later.[6]
For the "disjoint" version of the game with lines consisting of 5 marked points, the record of 82 lines[9] has been obtained by computer search, also found by Christopher Rosin. Previous 80 lines record was found in 2008 by Tristan Cazenave.[10] A 67-step solution was found in 2020 using an AlphaZero-like approach.[11]
Theory
Generalized Morpion solitaire, in which the starting configuration may be any finite set of marked points, is a member of the NP-hard class of problems for which no efficient computational method for finding an optimal solution is known. Even the problem of finding an approximately optimal solution for generalized Morpion solitaire is NP-hard.[2]
For the standard versions of Morpion solitaire, infinitely large solutions do not exist; upper bounds have been proven[2] on the maximum number of lines that can be obtained.[12]
References
- ^ "Morpion Solitaire - Origin". www.morpionsolitaire.com. Retrieved 2023-02-19 and references therein.
- ^ a b c Demaine, Erik D.; Demaine, Martin L.; Langerman, Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413, S2CID 9664785
- ^ a b T. Cazenave, "Reflexive Monte-Carlo Search", Computer Games Workshop 2007.
- ^ Boyer, Christian. "Morpion Solitaire – Rules of the Game". www.morpionsolitaire.com. Retrieved 2023-02-19.
- ^ a b Boyer, Christian. "Morpion Solitaire – Record Grids (5T game)". www.morpionsolitaire.com. Retrieved 2023-02-19.
- ^ a b Rosin, Chris. "A new Morpion Solitaire record via Monte-Carlo search". www.chrisrosin.com. Retrieved 2023-02-19.
- ^ a b Boyer, Christian. "Morpion Solitaire – List of the site's news added February 15th 2010". www.morpionsolitaire.com. Retrieved 2023-02-19.
- ^ H. Hyyrö and T. Poranen (2007). "New Heuristics for Morpion Solitaire".
- ^ Boyer, Christian. "Morpion Solitaire – Record Grids (5D game)". www.morpionsolitaire.com. Retrieved 2023-02-19.
- ^ T. Cazenave, "Nested Monte-Carlo Search", IJCAI 2009, pp. 456–461.
- ^ Wang, Hui; Preuss, Mike; Emmerich, Michael; Plaat, Aske (2020-06-14). "Tackling Morpion Solitaire with AlphaZero-likeRanked Reward Reinforcement Learning". arXiv:2006.07970 [cs.AI].
- ^ Boyer, Christian. "Morpion Solitaire – Score Limits". www.morpionsolitaire.com. Retrieved 2023-02-19.