* than our best solution. That is, we reject candidates where any of
* the hamming weights of the adjacency bitmap words are too large.
*
+ * We further winnow the set of possible adjacency matrices, by
+ * ensuring the same bit is not set in too many entries of adjmatrix
+ * (ie, as above, only considering output sticks).
+ *
* And, we want to do the search in order of increasing maximum
* hamming weight. This is because in practice optimal solutions tend
* to have low hamming weight, and having found a reasonable solution