Class: PuzzleSolvers.SandwichUniquenessConstraint

Assembly: PuzzleSolvers, Version=1.4.0.0, Culture=neutral, PublicKeyToken=null
Namespace: PuzzleSolvers
Show inherited types...
Inherits from:
- PuzzleSolvers.CombinationsConstraint
  - PuzzleSolvers.Constraint
    - object

Summary

Describes a “sandwich” constraint: the numbers sandwiched between two specific numbers must sum up to a specified total. This constraint implies a uniqueness constraint. The two specified numbers can be in any order.

Remarks

Warning: This constraint is very memory-intensive. It is implemented as a CombinationsConstraint with all of the possible number combinations for the specified set of cells. Avoid using this on oversized puzzles.

Constructors

SandwichUniquenessConstraint(int value1, int value2, int sum, IEnumerable<int> affectedCells, int minValue = 1, int maxValue = 9)

Static methods

int?[][]

GenerateCombinations(int minValue, int maxValue, int value1, int value2, int sum, int numAffectedCells)

Returns a collection containing all combinations of numAffectedCells cells of values between minValue and maxValue in which the sum of the digits sandwiched between value1 and value2 is sum.

Instance methods

ConstraintResult	Process(SolverState state) Inherited from CombinationsConstraint Overrides: Constraint.Process(SolverState)	Refer to the documentation for Constraint.Process.
string	ToString() Inherited from CombinationsConstraint Overrides: object.ToString()	Override.

Instance properties

int	Sum	The total that the sandwiched numbers must sum up to.
int	Value1	One of the numbers that form the edges of the sandwich (the other is SandwichUniquenessConstraint.Value2).
int	Value2	One of the numbers that form the edges of the sandwich (the other is SandwichUniquenessConstraint.Value1).