complete enumeration

Complete enumeration is the promise behind brute force: list every member of a set, once each, leaving none out and repeating none. Think of reading out a guest list — if you truly read every name exactly once, you can answer with certainty whether a given person is on it, or count how many there are, because nothing slipped past you.

The discipline has two halves that must both hold. No omission means every valid candidate appears in your enumeration; this is what lets you trust a no answer — you can only say no solution exists because you genuinely looked at all of them. No duplication means each candidate appears at most once; this is what keeps counts honest and avoids wasted work. A correct enumeration procedure usually proves both by construction: it imposes an order on the candidates (numeric order on codes, lexicographic order on subsets or permutations) and walks that order from first to last, so by induction every candidate is visited and the order guarantees no repeats.

Enumeration is exhaustive search viewed as a tour over a structured set. Its great strength is that completeness gives you certainty — exact answers to decision, counting, and optimization questions alike. Its great weakness is size: the sets that matter (all subsets, all permutations, all colorings) typically have 2^n, n!, or k^n members, so a complete tour is feasible only for small n. Recognizing the structure of the set — and learning to skip whole regions of it without breaking completeness — is the central skill of this field.