Domino Games and Complexity
From MaRDI portal
Publication:3495644
Recommendations
- Complexity of the game domination problem
- scientific article; zbMATH DE number 16390
- On the computational complexity of the domination game
- scientific article; zbMATH DE number 5555045
- Complexity, appeal and challenges of combinatorial games
- Domino-tiling games
- On the complexity of problems on simple games
- The complexity of poset games
- Strategy and Complexity of The Game of Squares
- The Complexity of Solitaire
Cited in
(17)- The complexity of solitaire
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
- Dominoes and the complexity of subclasses of logical theories
- The complexity of short two-person games
- On the solvability of domino snake problems
- Common knowledge and update in finite environments
- Undecidability of domino games and hhp-bisimilarity.
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
- Domino-tiling games
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
- Complexity analysis of propositional concurrent programs using domino tiling
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
- scientific article; zbMATH DE number 3976339 (Why is no real title available?)
- scientific article; zbMATH DE number 4025423 (Why is no real title available?)
- scientific article; zbMATH DE number 4061218 (Why is no real title available?)
- Domino Problem Under Horizontal Constraints
- Simple sentences that are hard to decide
This page was built for publication: Domino Games and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495644)
