Summary
Describes a constraint that mandates that the specified
values must form a contiguous
(orthogonally connected) area.
Constructors
|
Describes a constraint that mandates that the specified values must form a contiguous
(orthogonally connected) area. |
Static methods
HashSet<int> | FindArea(int cell, int width, int height, Func<int, bool> isValue) |
Provides a helper method to determine if an area is contiguous. |
int | |
Converts a convenient coordinate notation into a puzzle-grid index. |
IEnumerable<int> | |
Converts a convenient coordinate notation into puzzle-grid indices. |
Instance methods
Instance properties
int[] | | The group of cells affected by this constraint, or null if it affects all of them. |
bool | |
By default, a constraint is only evaluated once for every digit placed in the grid, but not when another
constraint merely rules out a possibility. Derived types can override this and return true to indicate
to the solver that the constraint should be reevaluated (meaning: have Constraint.Process(SolverState) called on it
again) when another constraint rules out a value in one of the affected cells of this constraint. |
int | | Height of the puzzle grid. |
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[] | | Set of values that must form a contiguous area. |
int | | Width of the puzzle grid. |