From skimming the documentation, paper, and playing with a couple of examples, I'm wondering how to get multiple solutions.
It looks like I could write another program that generates N Hampi files for N desired solutions, each with increased bounds (or some combination of other constraints). I'm wondering if there's a better way and whether, for a fixed N, I can get all solutions or run for a while waiting for more solutions. My use case is in generating a set of fixed-length strings for use in say, a VARCHAR SQL column.
As an aside, is there any known work on assigning probabilities to alternatives within Hampi s.t. N solutions from a possibly much larger M would follow a probability distribution rather than some depth-first traversal more designed for efficiency rather than being representative of a "common" production?