Morpion solitaire

DOI10.1007/S00224-005-1240-4MaRDI QIDQ864955zbMATH OpenOpenAlexWikidataFDO

Authors Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman

Publication date 13 February 2007

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-005-1240-4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Morpion solitaire 5D: a new upper bound of 121 on the maximum score
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Tetris is Hard, Even to Approximate
• Strategy and Complexity of The Game of Squares
• \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)

Cited in

(10)

• Complexity of Scorpion solitaire and applications to Klondike
• scientific article; zbMATH DE number 23707 (Why is no real title available?)
• Hyperbolic Minesweeper is in P
• An algorithmic analysis of the Honey-Bee game
• Assembling molecules in ATOMIX is hard
• scientific article; zbMATH DE number 1750694 (Why is no real title available?)
• Dots & Polygons (Media Exposition)
• \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
• Morpion solitaire 5D: a new upper bound of 121 on the maximum score
• Garden of Eden states in Austrian solitaire

This page was built for publication: Morpion solitaire

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864955)