On a generalization of ``eight blocks to madness puzzle
From MaRDI portal
Publication:906490
DOI10.1016/j.disc.2015.12.014zbMath1343.91013arXiv1408.3696OpenAlexW2213954224MaRDI QIDQ906490
Publication date: 21 January 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3696
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hashiwokakero is NP-complete
- Matching theory
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Classic Nintendo games are (computationally) hard
- An analysis of the (colored cubes)\(^{3}\) puzzle
- Variations on Instant Insanity
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- Tetris is Hard, Even to Approximate
- More Progress to Madness via "Eight Blocks"
- "Eight Blocks to Madness"-A Logical Solution
This page was built for publication: On a generalization of ``eight blocks to madness puzzle