Strategy and Complexity of The Game of Squares

DOI10.1112/S0024609397004001MaRDI QIDQ4265945zbMATH OpenFDO

Authors Florian Breuer, John Michael Robson

Publication date 21 March 2000

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/S0024609397004001

zbMATH Keywords

NP completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minesweeper may not be NP-complete but is hard nonetheless
• scientific article; zbMATH DE number 1944412
• Morpion solitaire
• Solitaire clobber
• Two Dots is NP-complete

Cited in

(13)

• \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
• Matchstick puzzles on a grid
• Towards an algorithmic guide to Spiral Galaxies
• Single-player and two-player buttons \& scissors games (extended abstract)
• On the complexity of Two Dots for narrow boards and few colors
• Domino Games and Complexity
• The Complexity of Solitaire
• scientific article; zbMATH DE number 1944412 (Why is no real title available?)
• Two Dots is NP-complete
• HIROIMONO Is NP-Complete
• How to play MetaSquares
• Minesweeper may not be NP-complete but is hard nonetheless
• Morpion solitaire

This page was built for publication: Strategy and Complexity of The Game of Squares

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