A SAT Encoding for the n-Fractions Problem

Research output: Working paper/PreprintPreprint

15 Downloads (Pure)

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.
Original languageEnglish GB
StatePublished - 2 Jul 2018

Publication series

NamearXiv:1612.08154 [cs]

Keywords

  • cs.DM

Cite this