Class: PuzzleSolvers.AntiBishopConstraint

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

  • PuzzleSolvers.AntiChessConstraint
    • PuzzleSolvers.Constraint
      • object

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.

Constructors

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

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.

Static methods

IEnumerable<int>

BishopsMoves(int cell, int gridWidth, int gridHeight)

Returns all cells reachable from the specified cell by a bishop’s move in chess.

Instance methods

ConstraintResult

Process(SolverState state) Inherited from AntiChessConstraint Overrides: Constraint.Process(SolverState) Sealed

Refer to the documentation for Constraint.Process.