Summary
Describes a constraint in a number-placement puzzle that indicates that whatever value the specified
FindTheValueConstraint.Cell contains, the cell that many steps away must contain
FindTheValueConstraint.Value.
Example
For example, if
FindTheValueConstraint.Cell is the top-left corner and the constraint covers the top row, then
FindTheValueConstraint.Cell can only contain a 3 if the fourth cell (3 cells to the right of the top-left corner) contains
FindTheValueConstraint.Value.
Constructors
| Constructor. |
|
Convenience constructor to generate a FindTheValueConstraint given a grid position, size, and a
direction. |
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 | | The “focus” cell that indicates how far FindTheValueConstraint.Value is. |
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 value that must be in the cell a number of steps away from FindTheValueConstraint.Cell. |
Nested types