Fair Distribution of Cookies

Partition a small array of cookie counts (n ≤ 8) into exactly k groups (each bag assigned whole) to minimize the maximum group sum — i.e., find a k-way partition that minimizes the largest subtotal. This is a combinatorial partitioning problem often solved by backtracking with pruning or bitmask DP.