English

A SAT Encoding for the $n$-Fractions Problem

Discrete Mathematics 2018-07-03 v1

Abstract

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.

Cite

@article{arxiv.1807.00507,
  title  = {A SAT Encoding for the $n$-Fractions Problem},
  author = {Michael Codish},
  journal= {arXiv preprint arXiv:1807.00507},
  year   = {2018}
}
R2 v1 2026-06-23T02:47:47.471Z