chiark
/
gitweb
/
~ianmdlvl
/
matchsticks-search.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
a7a2c25
)
commentary: document new criterion introduced in ea5f3526c7c0
author
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Sun, 9 Mar 2014 12:21:26 +0000
(12:21 +0000)
committer
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Sun, 9 Mar 2014 12:22:42 +0000
(12:22 +0000)
main.c
patch
|
blob
|
history
diff --git
a/main.c
b/main.c
index 93dc7ebe5325269db8fda05f5fe954a081489ed3..57a979654f705bd01912fe773cd01668a92ddb07 100644
(file)
--- 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.
*
* 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
* 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