Rather than the rewiring approach being currently, define a separate optimization problem which identifies the a subset of words having letter_excess < cutoff and also maximizes the total normalized word overlaps (or some combination of this + avg word length).
Requires defining a new CSP in the form of an optimization and taking the best result generated after X seconds.
Hidden words can be constructed out of whatever is leftover.
Rather than the rewiring approach being currently, define a separate optimization problem which identifies the a subset of words having letter_excess < cutoff and also maximizes the total normalized word overlaps (or some combination of this + avg word length).
Requires defining a new CSP in the form of an optimization and taking the best result generated after X seconds.
Hidden words can be constructed out of whatever is leftover.