Summary
Describes a “battlefield” constraint: the first and last number in the region represent the sizes of two armies, who
march inward; the clue specifies the sum of the digits that are sandwiched between the armies or that are within the
armies’ overlap. 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. (At
time of writing, this is only feasible for up to 11 cells, which uses about 2 GB of RAM for each constraint.)
Constructors
|
Describes a “battlefield” constraint: the first and last number in the region represent the sizes of two armies, who
march inward; the clue specifies the sum of the digits that are sandwiched between the armies or that are within the
armies’ overlap. This constraint implies a uniqueness constraint. |
Static methods
| int | | Calculates what the Battlefield clue would be for a given row of numbers. |
| int[][] | |
Generates (and caches) all possible combinations of digits that satisfy a given Battlefield clue. |
Instance methods
Instance properties
| int | | The sum of the digits sandwiched or overlapped. |