Programming, Binary Decision Diagrams, Computer Science, Boolean.
Every row contains each number (1–9) exactly once. Every column contains each number (1–9) exactly once. Each of the 9 outlined 3x3 grids contains each number (1–9) exactly once. Solved Sudoku puzzle. From https://en.wikipedia.org/wiki/Sudoku. A Sudoku puzzle can be represented as a giant boolean