Modeling Path Puzzles as SAT Problems and How to Solve Them
- 25 July 2024
- book chapter
- Published by Springer Nature
- p. 227-245
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzleInformation and Computation, 2022
- Empirical Study on SAT-Encodings of the At-Most-One Constraint2020
- Effective Problem Solving Using SAT SolversCommunications in Computer and Information Science, 2020
- Fill-a-Pix Puzzle as a SAT Problem2019
- Path Puzzles: Discrete Tomography with a Path Constraint is HardGraphs and Combinatorics, 2019
- SAT Encodings of the At-Most-k Constraint2019
- Mathematical Logic for Computer Science2012
- SudokuSat—A Tool for Analyzing Difficult Sudoku Puzzles2008
- Edge Matching Puzzles as Hard SAT/CSP Benchmarks2008
- Logic in Computer Science2004