Exact cover
= Exact cover
Given a <set> $U$ and a family of its <subsets>, an <exact cover> selects members of that family so that each element of $U$ belongs to exactly one selected member. Thus the selected members are <disjoint sets> whose <set union> is $U$. Anchoring a recursive choice at the smallest uncovered element avoids counting a cover in different orders.