Binary constraint: Difference between revisions

Revision as of 16:41, 18 August 2010

Revision as of 14:55, 2 October 2010

Line 1:

{{Unreferenced|date=January 2008}}

{{dicdef}}

'''Binary constraint''', in [[mathematical optimization]], is a constraint that involves exactly two variables. For example, consider the [[n-queens problem]], where the goal is to place ''n'' [[Queen (chess)|chess queens]] on an ''n''-by-''n'' chessboard such that none of the queens can attack each other (horizontally, vertically, or diagonally). The formal set of constraints are therefore "Queen 1 can't attack Queen 2", "Queen 1 can't attack Queen 3", and so on between all pairs of queens. Each constraint in this problem is binary, in that it only considers the placement of two individual queens.

'''Binary constraint''', in [[mathematical optimization]], is a constraint that involves exactly two variables.

<!-- Long comment to avoid being listed on short pages -->