deiruch.SATInterface 4.8.4

SATInterface

SATInterface is a .NET library to formulate SAT problems

Installation

Add a reference to the NuGet Package deiruch.SATInterface.

Features

• Maximize or minimize linear objective functions (3 strategies)
• Enumerate all solutions
• Supports linear combinations
• Convenient .NET operator overloading
• Simplify Boolean formulas
• Translate Boolean formulas to CNF
• Includes algorithms for
  • Counting (Totalizer)
  • At-most-one-constraints (7 implementations)
  • Exactly-one-constraints (9 implementations)
  • Exactly-k-constraints (4 implementations)
  • Unsigned integer arithmetic (Addition, Subtraction, Multiplication, Shifting)
• Export to DIMACS files
• Includes Kissat (https://github.com/arminbiere/kissat), CaDiCaL (https://github.com/arminbiere/cadical) and CryptoMiniSAT (see https://github.com/msoos/cryptominisat)

Usage example: Sudoku

using System;
using System.Linq;
using SATInterface;

using var m = new Model();
m.Configuration.Solver = InternalSolver.CaDiCaL;
m.Configuration.Verbosity = 2;

var v = m.AddVars(9, 9, 9);

//fix the first number to 1
v[0, 0, 0] = true;

//here's alternative way to set the second number
m.AddConstr(v[1, 0, 1]);

//assign one number to each cell
for (var y = 0; y < 9; y++)
    for (var x = 0; x < 9; x++)
        m.AddConstr(m.Sum(Enumerable.Range(0, 9).Select(n => v[x, y, n])) == 1);

//each number occurs once per row (alternative formulation)
for (var y = 0; y < 9; y++)
    for (var n = 0; n < 9; n++)
        m.AddConstr(m.ExactlyOneOf(Enumerable.Range(0, 9).Select(x => v[x, y, n])));

//each number occurs once per column (configured formulation)
for (var x = 0; x < 9; x++)
    for (var n = 0; n < 9; n++)
        m.AddConstr(m.ExactlyOneOf(Enumerable.Range(0, 9).Select(y => v[x, y, n]), Model.ExactlyOneOfMethod.PairwiseTree));

//each number occurs once per 3x3 block
for (var n = 0; n < 9; n++)
    for (var y = 0; y < 9; y += 3)
        for (var x = 0; x < 9; x += 3)
            m.AddConstr(m.Sum(
                v[x + 0, y + 0, n], v[x + 1, y + 0, n], v[x + 2, y + 0, n],
                v[x + 0, y + 1, n], v[x + 1, y + 1, n], v[x + 2, y + 1, n],
                v[x + 0, y + 2, n], v[x + 1, y + 2, n], v[x + 2, y + 2, n]) == 1);

m.Solve();

if (m.State == State.Satisfiable)
    for (var y = 0; y < 9; y++)
    {
        for (var x = 0; x < 9; x++)
            for (var n = 0; n < 9; n++)
                if (v[x, y, n].X)
                    Console.Write($" {n + 1}");
        Console.WriteLine();
    }