Class: PuzzleSolvers.SumUniquenessConstraint

• Assembly: PuzzleSolvers, Version=1.4.0.0, Culture=neutral, PublicKeyToken=null
• Namespace: PuzzleSolvers
• Show inherited types...
  Inherits from:

  • PuzzleSolvers.CombinationsConstraint
    • PuzzleSolvers.Constraint
      • object

Summary

Describes a “killer cage”: the numbers within the region must be unique and sum up to a specified total.

Remarks

Warning: This constraint is very memory-intensive. It is implemented as a CombinationsConstraint with all of the possible number combinations for the specified set of cells. Avoid using this on oversized puzzles.

Constructors

SumUniquenessConstraint(int sum, IEnumerable<int> affectedCells, int minValue = 1, int maxValue = 9)

Describes a “killer cage”: the numbers within the region must be unique and sum up to a specified total. (see also remarks)

Static methods

int[][]

GenerateCombinations(int minValue, int maxValue, int sum, int num, int[] forbiddenValues = null)

Generates all combinations of num unique values between minValue and maxValue that sum up to sum.

Instance methods

ConstraintResult	Process(SolverState state) Inherited from CombinationsConstraint Overrides: Constraint.Process(SolverState)	Refer to the documentation for Constraint.Process.
string	ToString() Inherited from CombinationsConstraint Overrides: object.ToString()	Override.

Instance properties

int

Sum

The total that the cells must sum up to.