Class: PuzzleSolvers.SandwichWraparoundUniquenessConstraint

• 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 wraparound” constraint: the numbers that follow a specific number and precede a specific other number, wrapping around the grid if necessary, must sum up to a specified total. This constraint implies a uniqueness constraint.

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

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

Describes a “sandwich wraparound” constraint: the numbers that follow a specific number and precede a specific other number, wrapping around the grid if necessary, must sum up to a specified total. This constraint implies a uniqueness constraint. (see also remarks)

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	The number that forms the beginning of the sandwich.
int	Value2	The number that forms the end of the sandwich.