SAT-based solving wins for Binairo, backtracking with constraint propagation wins for Hitori, and both puzzle types get new uniqueness-checked generators.
ACM Computing Surveys (CSUR)38(4), 12–es (2006)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles
SAT-based solving wins for Binairo, backtracking with constraint propagation wins for Hitori, and both puzzle types get new uniqueness-checked generators.