Summary
Describes a constraint in which a specified set of cells must have one of a specified set of value
combinations, but they may be reordered arbitrarily.
Constructors
AnagramConstraint(IEnumerable<int> affectedCells, IEnumerable<List<int>> combinations) | Constructor. |
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. |
List<int>[] | | The set of combinations allowed for the specified set of cells. |
int? | |
Indicates an approximate number of possible combinations of digits this constraint can still accommodate. This
will help the solver prioritize cells when multiple cells have the same number of combinations individually. |