Library for combinatorially specifying, constraining, and exploring genetic design spaces.

Uses backtracking (DFS-style traversal) to explore all character arrangements from the input string. Tracks each recursion depth (tree level) and stores the generated paths. After recursion, it removes duplicates at each level and returns the count of all unique character paths (not just full permutations).