A SAT Encoding for the n-Fractions Problem
classification
💻 cs.DM
keywords
problemencodingfractionscsplibdescribesinstancesnoteobtain
read the original abstract
This note describes a SAT encoding for the $n$-fractions puzzle which is problem 041 of the CSPLib. Using a SAT solver we obtain a solution for two of the six remaining open instances of this problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.