Class: PuzzleSolvers.Exotic.LittleSandwichConstraint

• Assembly: PuzzleSolvers, Version=1.4.0.0, Culture=neutral, PublicKeyToken=null
• Namespace: PuzzleSolvers.Exotic
• Show inherited types...
  Inherits from:

  • PuzzleSolvers.Constraint
    • object

Summary

Describes a “sandwich” constraint that does not imply uniqueness of all digits. The digits LittleSandwichConstraint.Digit1 and LittleSandwichConstraint.Digit2 must occur exactly once each (in any order) and form the edges of the sandwich. The numbers sandwiched between them must sum up to LittleSandwichConstraint.Sum.

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

LittleSandwichConstraint(IEnumerable<int> affectedCells, int sum, int digit1 = 1, int digit2 = 9, int minValue = 1, int maxValue = 9)

Constructor.

Instance methods

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

Instance properties

int	Digit1	One of the numbers that form the edges of the sandwich (the other is LittleSandwichConstraint.Digit2).
int	Digit2	One of the numbers that form the edges of the sandwich (the other is LittleSandwichConstraint.Digit1).
int	Sum	The total that the sandwiched numbers must sum up to.