X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?p=matchsticks-search.git;a=blobdiff_plain;f=main.c;h=93dc7ebe5325269db8fda05f5fe954a081489ed3;hp=b7aae53e43007901eb4a547a2d52a188eb61efc2;hb=a7a2c255e61d14619fce2e4af2eeee1d2ed6d870;hpb=eee0048ef0047180eefb8407e4e441e59fd902b9
diff --git a/main.c b/main.c
index b7aae53..93dc7eb 100644
--- a/main.c
+++ b/main.c
@@ -58,7 +58,8 @@
*
* We search all possible adjacency matrices, and for each one we run
* GLPK's simplex solver. We represent the adjacency matrix as an
- * array of bitmaps.
+ * array of bitmaps: one word per input stick, with one bit per output
+ * stick.
*
* However, there are a couple of wrinkles:
*
@@ -76,7 +77,7 @@
* nondecreasing in array order.
*
* Once we have a solution, we also avoid considering any candidate
- * which involves dividing one of the output sticks into so many
+ * which involves dividing one of the input sticks into so many
* fragment that the smallest fragment would necessarily be no bigger
* than our best solution. That is, we reject candidates where any of
* the hamming weights of the adjacency bitmap words are too large.