ref: e7b2a9dd8d8915802fb69ce2242b1f913b7f3172
parent: 2efc77d2fde7e53604f8490b57f18a36eec5c4fb
author: Simon Tatham <anakin@pobox.com>
date: Wed May 4 14:22:15 EDT 2011
Having looked at Keen's clue selection code, I also notice that the intended behaviour of classifying multiplication clues as low-quality if they only left one possible pair of multiplicands has never actually worked, because I should have compared the possible clue count against 2 rather than 1 since the multiplicands can occur either way round. [originally from svn r9165]
--- a/keen.c
+++ b/keen.c
@@ -931,7 +931,7 @@
for (k = 1; k <= w; k++)
if (v % k == 0 && v / k <= w && v / k != k)
n++;
- if (n > 1)
+ if (n > 2)
singletons[j] |= F_MUL;
else
singletons[j] |= F_MUL_BAD;