X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ian/git?a=blobdiff_plain;f=filling.c;h=3797e5c5ff94515879d857d2a6c7f3aef3f08d70;hb=1cf403ceb81482dea7107a49573d6834c5a650d1;hp=2edec91dca824340a98f20fbca1fe4ea0c29afe2;hpb=90af15b43ed57a6835091bb1c98227052590b3ea;p=sgt-puzzles.git

diff --git a/filling.c b/filling.c
index 2edec91..3797e5c 100644
--- a/filling.c
+++ b/filling.c
@@ -977,7 +977,7 @@ static int learn_bitmap_deductions(struct solver_state *s, int w, int h)
 	 * reached by extending an existing region - we don't need to
 	 * know exactly _how far_ out of reach it is.
 	 */
-	for (i = 0; i <= sz; i++) {
+	for (i = 0; i < sz; i++) {
 	    if (s->board[i] == n) {
 		/* Square is part of an existing CC. */
 		minsize[i] = dsf_size(s->dsf, i);
@@ -1024,7 +1024,7 @@ static int learn_bitmap_deductions(struct solver_state *s, int w, int h)
 	 * in the bitmap reinstated, because we've found that it's
 	 * potentially reachable by extending an existing CC.
 	 */
-	for (i = 0; i <= sz; i++)
+	for (i = 0; i < sz; i++)
 	    if (minsize[i] <= n)
 		bm[i] |= 1<<n;
     }