shithub: puzzles

Info  •  Files  •  Log  •  Branches

Patch from Chris Moore to improve the generality of
grid_nearest_edge(), by having it search harder for a better dot to
move to in the first loop.

[originally from svn r9106]

--- a/grid.c

+++ b/grid.c

@@ -141,13 +141,11 @@

                 grid_dot *d = f->dots[j];

                 if (d == cur) continue;

                 new_dist = SQ((long)d->x - (long)x) + SQ((long)d->y - (long)y);

-                if (new_dist < dist) {

+                if (new_dist < dist) { /* found closer dot */

                     new = d;

-                    break; /* found closer dot */

+                    dist = new_dist;

                 }

             }

-            if (new != cur)

-                break; /* found closer dot */

         }

         if (new == cur) {