Personal website Rudolf Adamkovič

Home / Computer science / Boolean satisfiability problem (SAT)


Tips

  • Assign hard-to-satisfy vars first, to cut down the search space.
  • Can be made into an optimization problem of minimizing unsat clauses.

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.