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
Static methods
int[][] | |
Generates all combinations of num unique values between minValue and
maxValue that sum up to sum. |
int | |
Converts a convenient coordinate notation into a puzzle-grid index. |
IEnumerable<int> | |
Converts a convenient coordinate notation into puzzle-grid indices. |
Instance methods
Instance properties
int[] | | The group of cells affected by this constraint, or null if it affects all of them. |
bool | | Override; see base. |
int?[][] | | The set of combinations allowed for the specified set of cells. |
int? | | Override; see base. |
int | | The total that the cells must sum up to. |