Constructor: SumUniquenessConstraint(int, IEnumerable<int>, int, int)

• Declared in: PuzzleSolvers.SumUniquenessConstraint

Declaration

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

Summary

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

Parameters

int	sum	The total that the cells must sum up to.
IEnumerable<int>	affectedCells	The set of cells affected by this constraint (the “cage”).
int	minValue	The minimum value of numbers in the grid for this puzzle.
int	maxValue	The maximum value of numbers in the grid for this puzzle.

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.