Discrete Optimization, Truth Tables, and Clustering

Status: outline — connect SAT-Table / N-Queens demos to clustering ideas.

Goals¶

• Discrete search and assignment as optimization

• Truth tables and feasible assignments

• Why discrete structure motivates clustering and partitioning

Outline¶

1. Decision variables, constraints, objective

2. Truth tables and enumeration (SAT-Table)

3. N-Queens as a structured assignment problem

4. From hard constraints to soft grouping $\rightarrow$ clustering

5. Lab link: SAT-Table, N-Queen notebooks

Sources¶

• Class notebooks SAT-Table, N-Queen

• Optional: SAT-Solver.cpp as a small code reference