Constraint problems

Constraint problems ask: 'How many ways can we arrange or select objects, given certain restrictions?' Common restrictions include: some objects must (or must not) be together, certain positions are forbidden, or some objects are indistinguishable. Solving these often involves breaking the problem into cases, using complementary counting, or applying the inclusion-exclusion principle.

Important properties

• Constraints reduce the total number of possible arrangements or selections.

• Common strategies: casework, complementary counting, and inclusion-exclusion.

• Sometimes, constraints can be handled by treating groups of objects as single units (e.g., 'block' method).

• Constraints may make some arrangements impossible.