Plans for Maximagenerators (of SATproblems) related to latin squares problems.
More...
Go to the source code of this file.
Detailed Description
Plans for Maximagenerators (of SATproblems) related to latin squares problems.
 Todo:
 Relations to other modules
 Todo:
 Organisation

Perhaps we need a new submodule "LatinSquares".

This file would then be called "general".

And also Lisp/Generators/Sudoku would be moved there.
 Todo:
 Different encodings
 Todo:
 Further conditions
 Todo:
 Update
 Todo:
 Systematisation

We do very similar things for latin squares, Sudoku problems and e.g., pigeonhole formulas.

Cardinality constraints [1,L,inf] and [0,L,1]:

The simplest way of making the similarities more visible is to use "at most one" and "at least one" cardinality constraints, which express, for a given set L of literals, the boolean function on the variables involved that at most one resp. at least one of the literals is true.

See Satisfiability/Lisp/PseudoBoolean/plans/CardinalityConstraints.hpp.

Strong hypergraph colouring

Bijectivity constraints
 Todo:
 Extensions
 Todo:
 Generators for latin square completion problems
Definition in file LatinSquares.hpp.