Rikudo is NP-complete
From MaRDI portal
Publication:2118858
DOI10.1016/j.tcs.2022.01.034OpenAlexW4210480498MaRDI QIDQ2118858
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.034
Cites Work
- Unnamed Item
- Unnamed Item
- Minesweeper may not be NP-complete but is hard nonetheless
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Gobang is PSPACE-complete
- Hamiltonian cycles in T-graphs
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
- Planar 3DM is NP-complete
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- GO Is Polynomial-Space Hard
- Efficient Planarity Testing
- The Computational Complexity of the Game of Set and Its Theoretical Applications
- Minesweeper is NP-complete.