Summary
Describes a constraint in which a specific region of cells must sum up to the value in another cell. In a variant
Sudoku, this is often represented as an arrow coming out of a circle, and hence, the variant is known as “Arrow
Sudoku”.
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? | |
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. |
int[] | | The set of cells that must sum up to the value in IndirectSumConstraint.SumCell. |
int | | The cell that must contain the desired sum. |