Advertisement

485 – A New Upper Bound for Morpion Solitaire

Conference paper
  • 401 Downloads
Part of the Communications in Computer and Information Science book series (CCIS, volume 614)

Abstract

In previous research an upper bound of 705 was proved on the number of moves in the 5T variant of the Morpion Solitaire game. We show a new upper bound of 485 moves. This is achieved in the following way: we encode Morpion 5T rules as a linear program and solve 126912 instances of this program on special octagonal boards. In order to show correctness of this method we analyze rules of the game and use a concept of a potential of a given position. By solving continuous-valued relaxations of linear programs on these boards, we obtain an upper bound of 586 moves. Further analysis of original, not relaxed, mixed-integer programs leads to an improvement of this bound to 485 moves. However, this is achieved at a significantly higher computational cost.

Keywords

Linear Relaxation External Edge Optimization Software Lattice Graph Position Graph 
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.

References

  1. 1.
    Boyer, C.: Morpion solitaire (2008). http://www.morpionsolitaire.com
  2. 2.
    Demaine, E.D., Demaine, M.L., Langerman, A., Langerman, S.: Morpion solitaire. Theory Comput. Syst. 39(3), 439–453 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Gurobi Optimization, I.: Gurobi optimizer reference manual (2015). http://www.gurobi.com
  4. 4.
    Kawamura, A., Okamoto, T., Tatsu, Y., Uno, Y., Yamato, M.: Morpion solitaire 5d: a new upper bound 121 on the maximum score. In: CCCG (2013)Google Scholar
  5. 5.
    Michalewski, H., Nagrko, A., Pawlewicz, J.: Linear programs giving a new upper bound in the Morpion 5T game (2015). https://github.com/anagorko/morpion-lpp
  6. 6.
    Rosin, C.D.: Nested rollout policy adaptation for monte carlo tree search. In: IJCAI, pp. 649–654 (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Faculty of Mathematics, Informatics, and MechanicsUniversity of WarsawWarsawPoland

Personalised recommendations