From b6c1176e49824e8e043ece399fb94d6bb93617a7 Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Sun, 9 Mar 2014 12:21:26 +0000 Subject: [PATCH] commentary: document new criterion introduced in ea5f3526c7c0 --- main.c | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/main.c b/main.c index 93dc7eb..57a9796 100644 --- a/main.c +++ b/main.c @@ -82,6 +82,10 @@ * 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 -- 2.30.2