Summary
Describes a constraint as used in Neighbor Sum Sudoku by Timwi
(https://logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=0005NV): Each number outside the grid gives the sum
of all orthogonal neighbors of one cell in the corresponding row or column. Where multiple numbers are given, the
sums must be in the same order as the clues.
Remarks
This is implemented as a
CombinationsConstraint, which may make it very memory-intensive 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[] | | Specifies the set of neighbor sums. Currently only 1 or 2 numbers are supported. |
int?[][] | | The set of combinations allowed for the specified set of cells. |
bool | | Specifies whether the constraint applies to a column (true ) or row (false ). |
int? | | Override; see base. |
int | | Specifies the affected row or column (depending on NeighborSumConstraint.IsCol). |