A SAT Encoding for the $n$-Fractions Problem

TL;DR

This paper presents a SAT encoding for the $n$-fractions puzzle, successfully solving two previously open instances using a SAT solver, advancing the understanding of this combinatorial problem.

Contribution

The paper introduces a novel SAT encoding for the $n$-fractions problem and demonstrates its effectiveness on open instances.

Findings

Solved two previously open instances of the problem

Demonstrated the effectiveness of SAT encoding for combinatorial puzzles

Contributed to solving open problems in the CSPLib

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.