Example: 8-Queens problem

• Place 8 queens on a chess board such that they are not able to take each other

• This implies the following three constraints:

  • 1 queen per column
  • 1 queen per row
  • 1 queen on any diagonal

• This encoding of the constraints ensures that the attractors of the network correspond to valid solutions