Legend

Class
Struct
Enum
Interface
Delegate
Constructor
Method
Property
Event
Field

Class: PuzzleSolvers.Exotic.NeighborSumConstraint

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

NeighborSumConstraint(bool isCol, int rowCol, int[] clue, IEnumerable<UniquenessConstraint> furtherRestrictions = null, int gridWidth = 9, int gridHeight = 9, int minValue = 1, int maxValue = 9)
Constructor.

Instance methods

ConstraintResultRefer to the documentation for Constraint.Process.
stringOverride.

Static methods

int
TranslateCoordinate(string str, int gridWidth = 9)
Converts a convenient coordinate notation into a puzzle-grid index.
IEnumerable<int>
TranslateCoordinates(string str, int gridWidth = 9)
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.
boolRefer to the documentation for Constraint.CanReevaluate.
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.
boolSpecifies whether the constraint applies to a column (true) or row (false).
int?Refer to the documentation for Constraint.NumCombinations.
intSpecifies the affected row or column (depending on NeighborSumConstraint.IsCol).