Complexity-Aware Symbolic Solvers for Sudoku: Towards Interpretability and Cognitive Alignment in Constraint Problem Solving

Abstract excerpt

<title>Abstract</title> <p>SAT and Constraint Programming (CP) remain the fastest exact Sudoku solvers, on average taking milliseconds to solve even hard puzzles. They are, however, black-box optimizers and hence lack symbolic interpretability. The present article describes a complementary deterministic approach that explains reasoning with four symbolic solvers: Dynamic Constraint Propagation Backtracking (DCPB)...

Topics

Open a Topic to create a Post that cites this publication.

• Genetic Code
• Human Genome Project
• Immunoglobulins
• Molecular Biology
• Mutation

Identifiers and source

Literature Corpus work

d7c7243c-3175-5b01-bf82-83910d52e926

DOI

10.21203/rs.3.rs-8354205/v1