Efficient SAT-Based Approach for Solving Juosan Puzzles
- 25 July 2024
- book chapter
- Published by Springer Nature
- p. 211-226
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzleInformation and Computation, 2022
- Effective Problem Solving Using SAT SolversCommunications in Computer and Information Science, 2020
- SAT Encodings of the At-Most-k Constraint2019
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer2016
- Mathematical Logic for Computer Science2012
- SudokuSat—A Tool for Analyzing Difficult Sudoku Puzzles2008
- Edge Matching Puzzles as Hard SAT/CSP Benchmarks2008
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005
- Logic in Computer Science2004
- An empirical comparison of seven programming languagesComputer, 2000