* 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);
* 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;
}