Summary
Describes a constraint that will solve a Kyudoku puzzle given a 6×6 grid of numbers 1–9. The solution will contain
a 0 for marked cells and a 1 for struck-out cells.
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 | |
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[] | | Initial grid of numbers to operate on. |
| 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. |