From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Sun, 9 Mar 2014 12:21:26 +0000 (+0000)
Subject: commentary: document new criterion introduced in ea5f3526c7c0
X-Git-Url: https://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?a=commitdiff_plain;h=b6c1176e49824e8e043ece399fb94d6bb93617a7;p=matchsticks-search.git

commentary: document new criterion introduced in ea5f3526c7c0
---

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