Constructor: AntiBishopConstraint(int, int, int[], IEnumerable<int>)

• Declared in: PuzzleSolvers.AntiBishopConstraint

Declaration

public AntiBishopConstraint(
    int gridWidth,
    int gridHeight,
    int[] affectedValues = null,
    IEnumerable<int> enforcedCells = null
)

Summary

Describes a constraint in a number placement puzzle in which cells that are diagonal from each other (like a bishop’s move in chess) cannot contain the same value.

Parameters

int	gridWidth	See AntiChessConstraint.GridWidth.
int	gridHeight	See AntiChessConstraint.GridHeight.
int[]	affectedValues	See AntiChessConstraint.AffectedValues.
IEnumerable<int>	enforcedCells	See AntiChessConstraint.EnforcedCells. If null, the default is to enforce the entire grid.