ref: b2d7429d539238258ca6f9061da5a25a0835f2a9
parent: 7024735f89c7b04b57e7ea41d5104a3455c91348
author: Simon Tatham <anakin@pobox.com>
date: Tue Jan 17 13:53:02 EST 2012
Fix a bug causing premature defeatism in the Bridges solver. Deducing a better upper bound on the number of bridges leaving a given island in a given direction was not counted as having 'done something'; so a solver run could make several such deductions, but then terminate in the belief that it hadn't achieved anything, when just going back round the main solver loop would have enabled it to make further deductions based on those new bounds. [originally from svn r9377]
--- a/bridges.c
+++ b/bridges.c
@@ -1505,11 +1505,11 @@
if (maxb == 0) {
debug(("...adding NOLINE.\n"));
solve_join(is, i, -1, 0); /* we can't have any bridges here. */
- didsth = 1;
} else {
debug(("...setting maximum\n"));
solve_join(is, i, maxb, 1);
}
+ didsth = 1;
}
map_update_possibles(is->state);
}