Summary
Describes a “sandwich” constraint: the numbers sandwiched between two specific numbers must sum up to a specified
total. This constraint implies a uniqueness constraint. The two specified numbers can be in any order.
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
Instance methods
Static methods
int | |
Converts a convenient coordinate notation into a puzzle-grid index. |
IEnumerable<int> | |
Converts a convenient coordinate notation into puzzle-grid indices. |
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 sandwiched numbers must sum up to. |
int | | One of the numbers that form the edges of the sandwich (the other is SandwichUniquenessConstraint.Value2). |
int | | One of the numbers that form the edges of the sandwich (the other is SandwichUniquenessConstraint.Value1). |