A SAT Encoding for the $n$-Fractions Problem
Michael Codish · arXiv (Cornell University) · 2018
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.