This note describes a SAT encoding for the nn-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.
生成讲解博客的中文版本
生成AI智能校验的中文版本